A Stochastic Derivative Free Optimization Method with Momentum
Not on the map. Why?
Abstract (arXiv)
We consider the problem of unconstrained minimization of a smooth objective function in ℝ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) citeBergou2018. 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 citeTodorov2012 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 SMTPIS. We provide convergence analysis of this method for non-convex, convex and strongly convex objectives.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). First posted on arXiv 30 May 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 1; 2024: 0; 2025: 1; 2026: 3.
9 papers.
- 2021Derivative-Free Reinforcement Learning: A Reviewcited by 15
- 2021Curvature-Aware Derivative-Free Optimizationcited by 7
- 2022Minibatch Stochastic Three Points Method for Unconstrained Smooth Minimizationcited by 6
- 2023Towards a Better Theoretical Understanding of Independent Subnetwork Trainingcited by 6
- 2022Variance Reduction is an Antidote to Byzantines: Better Rates, Weaker Assumptions and Communication Compression as a Cherry on the Topcited by 2
- 2025Stochastic Optimization with Random Searchcited by 1
- 2026Finding Stationary Points by Comparisonscited by 1
- 2026Trust the Direction, Search the Step: Zero-and-First-Order Methods for LLM Fine-Tuningcited by 0
- 2026TACO: Ternary Absolute-max Column-wise One-sparse Optimizer for LLM Fine-Tuningcited by 0
- 2026TACO: Ternary Absolute-max Column-wise One-sparse Optimizer for LLM Fine-Tuning1 Oct 2026
- 2026Trust the Direction, Search the Step: Zero-and-First-Order Methods for LLM Fine-Tuning1 Oct 2026
- 2026Finding Stationary Points by Comparisons25 Jun 2026
- 2025Stochastic Optimization with Random Search17 Oct 2025
- 2023Towards a Better Theoretical Understanding of Independent Subnetwork Training28 Jun 2023
- 2022Minibatch Stochastic Three Points Method for Unconstrained Smooth Minimization16 Sep 2022
- 2022Variance Reduction is an Antidote to Byzantines: Better Rates, Weaker Assumptions and Communication Compression as a Cherry on the Top1 Jun 2022
- 2021Curvature-Aware Derivative-Free Optimization27 Sep 2021
- 2021Derivative-Free Reinforcement Learning: A Review10 Feb 2021