Pith. sign in

REVIEW

Policy-based optimization: single-step policy gradient method seen as an evolution strategy

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2104.06175 v3 pith:H4BFERBZ submitted 2021-04-13 math.OC

Policy-based optimization: single-step policy gradient method seen as an evolution strategy

classification math.OC
keywords methodoptimizationpolicyapproachblack-boxevolutiongradientmethods
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This research reports on the recent development of a black-box optimization method based on single-step deep reinforcement learning (DRL), and on its conceptual proximity to evolution strategy (ES) techniques. In the fashion of policy gradient (PG) methods, the policy-based optimization (PBO) algorithm relies on the update of a policy network to describe the density function of its next generation of individuals. The method is described in details, and its similarities to both ES and PG methods are pointed out. The relevance of the approach is then evaluated on the minimization of standard analytic functions, with comparison to classic ES techniques (ES, CMA-ES). It is then applied to the optimization of parametric control laws designed for the Lorenz attractor. Given the scarce existing literature on the method, this contribution definitely establishes the PBO method as a valid, versatile black-box optimization technique, and opens the way to multiple future improvements allowed by the flexibility of the neural networks approach.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.