A Stochastic Derivative Free Optimization Method with Momentum
Eduard Gorbunov, Adel Bibi, Ozan Sener, El Houcine Bergou, Peter Richtárik
Abstract
We consider the problem of unconstrained minimization of a smooth objective function in 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) . 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 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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 555d03dc-b4cb-4827-8473-7220ce11b082Cited by top-tier papers8
- Gradientless Descent: High-Dimensional Zeroth-Order OptimizationDaniel Golovin, John Karro, Greg Kochanski, Chansoo Lee et al.ICLR 2020 · 85 citations
- Efficient On-Chip Learning for Optical Neural Networks Through Power-Aware Sparse Zeroth-Order OptimizationJiaqi Gu, Chenghao Feng, Zheng Zhao, Zhoufeng Ying et al.AAAI 2021 · 41 citations
- An Accelerated DFO Algorithm for Finite-sum Convex FunctionsYuwen Chen, Antonio Orvieto, Aurélien LucchiICML 2020 · 15 citations
- Acceleration Exists! Optimization Problems When Oracle Can Only Compare Objective Function ValuesAleksandr V. Lobanov, Alexander V. Gasnikov, Andrey KrasnovNeurIPS 2024 · 8 citations
- Minibatch Stochastic Three Points Method for Unconstrained Smooth MinimizationSoumia Boucherouite, Grigory Malinovsky, Peter Richtárik, El Houcine BergouAAAI 2024 · 6 citations
Related papers
- A Stochastic Derivative-Free Optimization Method with Importance Sampling: Theory and Learning to ControlAdel Bibi, El Houcine Bergou, Ozan Sener, Bernard Ghanem et al.AAAI 2020 · 15 citations
- On the Almost Sure Convergence of the Stochastic Three Points AlgorithmTaha el Bakkali el Kadi, Omar SaadiICLR 2025
- Gradient-Free Method for Heavily Constrained Nonconvex OptimizationWanli Shi, Hongchang Gao, Bin GuICML 2022 · 5 citations
- Convergence of a Stochastic Gradient Method with Momentum for Non-Smooth Non-Convex OptimizationVien V. Mai, Mikael JohanssonICML 2020 · 10 citations
- Gradient-Free Approaches is a Key to an Efficient Interaction with Markovian StochasticityBoris Prokhorov, Semyon Chebykin, Alexander Gasnikov, Aleksandr BeznosikovICML 2026
