A Stochastic Derivative Free Optimization Method with Momentum
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:ED7X6UK3record.jsonopen to challenge →
read the original abstract
We consider the problem of unconstrained minimization of a smooth objective function in $\mathbb{R}^d$ in setting where only function evaluations are possible. We propose and analyze stochastic zeroth-order method with heavy ball momentum. In particular, we propose, SMTP, a momentum version of the stochastic three-point method (STP) \cite{Bergou_2018}. We show new complexity results for non-convex, convex and strongly convex functions. We test our method on a collection of learning to continuous control tasks on several MuJoCo \cite{Todorov_2012} environments with varying difficulty and compare against STP, other state-of-the-art derivative-free optimization algorithms and against policy gradient methods. SMTP significantly outperforms STP and all other methods that we considered in our numerical experiments. Our second contribution is SMTP with importance sampling which we call SMTP_IS. We provide convergence analysis of this method for non-convex, convex and strongly convex objectives.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Finding Stationary Points by Comparisons
Presents classical Õ(n²/ε^{1.5}) and quantum Õ(n/ε^{1.5}) query algorithms for ε-stationary points of twice-differentiable non-convex functions with Lipschitz gradient and Hessian via comparison oracles.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.