An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization
Eduard Gorbunov, Pavel Dvurechensky, Alexander Gasnikov

TL;DR
This paper introduces accelerated and non-accelerated derivative-free algorithms for smooth stochastic convex optimization with noisy observations, achieving near-optimal complexity bounds with improvements for sparse solutions.
Contribution
It presents novel accelerated and non-accelerated derivative-free algorithms with complexity bounds close to gradient-based methods, including enhancements for sparse solutions using 1-norm proximal setups.
Findings
Accelerated algorithm's complexity is only √n worse than gradient-based methods.
Non-accelerated algorithm matches stochastic-gradient bounds, with logarithmic factors.
Proposed methods perform better for sparse solutions using 1-norm proximal setup.
Abstract
We consider an unconstrained problem of minimizing a smooth convex function which is only available through noisy observations of its values, the noise consisting of two parts. Similar to stochastic optimization problems, the first part is of stochastic nature. The second part is additive noise of unknown nature, but bounded in absolute value. In the two-point feedback setting, i.e. when pairs of function values are available, we propose an accelerated derivative-free algorithm together with its complexity analysis. The complexity bound of our derivative-free algorithm is only by a factor of larger than the bound for accelerated gradient-based algorithms, where is the dimension of the decision variable. We also propose a non-accelerated derivative-free algorithm with a complexity bound similar to the stochastic-gradient-based algorithm, that is, our bound does not have…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Sparse and Compressive Sensing Techniques · Markov Chains and Monte Carlo Methods
