On the Optimal Construction of Unbiased Gradient Estimators for Zeroth-Order Optimization
Not on the map. Why?
Abstract (arXiv)
Zeroth-order optimization (ZOO) is an important framework for stochastic optimization when gradients are unavailable or expensive to compute. A potential limitation of existing ZOO methods is the bias inherent in most gradient estimators unless the perturbation stepsize vanishes. In this paper, we overcome this biasedness issue by proposing a novel family of unbiased gradient estimators based solely on function evaluations. By reformulating directional derivatives as a telescoping series and sampling from carefully designed distributions, we construct estimators that eliminate bias while maintaining favorable variance. We analyze their theoretical properties, derive optimal scaling distributions and perturbation stepsizes of four specific constructions, and prove that SGD using the proposed estimators achieves optimal complexity for smooth non-convex objectives. Experiments on synthetic tasks and language model fine-tuning confirm the superior accuracy and convergence of our approach compared to standard methods.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 51 of its 68 references that are in the map. First posted on arXiv 22 Oct 2025.
Builds on
51 of 68 references.
References · 51
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
- 2016Adversarial Machine Learning at Scalecited by 934
- 2016Practical Black-Box Attacks against Machine Learningcited by 893
- 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 716
- 2017ZOO: Zeroth Order Optimization based Black-box Attacks to Deep Neural Networks without Training Substitute Modelscited by 656
- 2014SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectivescited by 401
- 2023Fine-Tuning Language Models with Just Forward Passescited by 337
- 2018SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimatorcited by 283
- 2017SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradientcited by 218
- 2013Optimal rates for zero-order convex optimization: the power of two function evaluationscited by 190
- 2020A Primer on Zeroth-Order Optimization in Signal Processing and Machine Learningcited by 160
- 2020Better Theory for SGD in the Nonconvex Worldcited by 156
38 more
- 2024Revisiting Zeroth-Order Optimization for Memory-Efficient LLM Fine-Tuning: A Benchmarkcited by 113
- 2020Random Reshuffling: Simple Analysis with Vast Improvementscited by 112
- 2018Zeroth-Order Stochastic Variance Reduction for Nonconvex Optimizationcited by 109
- 2015An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedbackcited by 105
- 2022Do Differentiable Simulators Give Better Policy Gradients?cited by 83
- 2019A Theoretical and Empirical Comparison of Gradient Approximations in Derivative-Free Optimizationcited by 66
- 2024Variance-reduced Zeroth-Order Methods for Fine-Tuning Language Modelscited by 50
- 2018Structured Evolution with Compact Architectures for Scalable Policy Optimizationcited by 48
- 2019Improved Zeroth-Order Variance Reduced Algorithms and Analysis for Nonconvex Optimizationcited by 47
- 2021A Zeroth-Order Block Coordinate Descent Algorithm for Huge-Scale Black-Box Optimizationcited by 46
- 2020Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Samplingcited by 45
- 2024Private Fine-tuning of Large Language Models with Zeroth-order Optimizationcited by 41
- 2022Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimizationcited by 40
- 2021A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensionscited by 37
- 2024Zeroth-Order Fine-Tuning of LLMs with Extreme Sparsitycited by 27
- 2016Highly-Smooth Zero-th Order Online Optimization Vianney Perchetcited by 22
- 2021Zeroth order optimization with orthogonal random directionscited by 21
- 2023An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimizationcited by 20
- 2020Towards Query-Efficient Black-Box Adversary with Zeroth-Order Natural Gradient Descentcited by 18
- 2023Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimizationcited by 16
- 2018Towards Gradient Free and Projection Free Stochastic Optimizationcited by 15
- 2020A One-bit, Comparison-Based Gradient Estimatorcited by 15
- 2023Gradient-free optimization of highly smooth functions: improved analysis and a new algorithmcited by 12
- 2024Memory-Efficient Gradient Unrolling for Large-Scale Bi-level Optimizationcited by 11
- 2024Addax: Utilizing Zeroth-Order Gradients to Improve Memory Efficiency and Performance of SGD for Fine-Tuning Language Modelscited by 11
- 2023An Optimal Structured Zeroth-order Algorithm for Non-smooth Optimizationcited by 10
- 2022Stochastic Zeroth order Descent with Structured Directionscited by 8
- 2024Simultaneous Computation and Memory Efficient Zeroth-Order Optimizer for Fine-Tuning Large Language Modelscited by 8
- 2022A gradient estimator via L1-randomization for online zero-order optimization with two point feedbackcited by 7
- 2022Randomized gradient-free methods in convex optimizationcited by 7
- 2019Faster Gradient-Free Proximal Stochastic Methods for Nonconvex Nonsmooth Optimizationcited by 6
- 2022Data Sampling Affects the Complexity of Online SGD over Dependent Datacited by 5
- 2025ZO2: Scalable Zeroth-Order Fine-Tuning for Extremely Large Language Models with Limited GPU Memorycited by 5
- 2020Understanding the Impact of Model Incoherence on Convergence of Incremental SGD with Random Reshufflecited by 4
- 2021Accelerated Proximal Alternating Gradient-Descent-Ascent for Nonconvex Minimax Machine Learningcited by 4
- 2025ElasticZO: A Memory-Efficient On-Device Learning with Combined Zeroth- and First-Order Optimizationcited by 4
- 2025KerZOO: Kernel Function Informed Zeroth-Order Optimization for Accurate and Accelerated LLM Fine-Tuningcited by 4
- 2020Gradient and Hessian approximations in Derivative Free Optimizationcited by 3
50 most cited of 51 All 51 (JSON)
Built on by
Citing papers per year: 2026: 2.
2 papers.