mlsanityData to 14 Oct 2026

Revisiting Zeroth-Order Optimization: Minimum-Variance Two-Point Estimators and Directionally Aligned Perturbations

arXiv 2510.19975 ↗First posted 22 Oct 2025cs.LG cs.AI math.OCcited by 11

Not on the map. Why?

Abstract (arXiv)

In this paper, we explore the two-point zeroth-order gradient estimator and identify the distribution of random perturbations that minimizes the estimator's asymptotic variance as the perturbation stepsize tends to zero. We formulate it as a constrained functional optimization problem over the space of perturbation distributions. Our findings reveal that such desired perturbations can align directionally with the true gradient, instead of maintaining a fixed length. While existing research has largely focused on fixed-length perturbations, the potential advantages of directional alignment have been overlooked. To address this gap, we delve into the theoretical and empirical properties of the directionally aligned perturbation (DAP) scheme, which adaptively offers higher accuracy along critical directions. Additionally, we provide a convergence analysis for stochastic gradient descent using δ-unbiased random perturbations, extending existing complexity bounds to a wider range of perturbations. Through empirical evaluations on both synthetic problems and practical tasks, we demonstrate that DAPs outperform traditional methods under specific conditions.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 31 of its 51 references that are in the map. First posted on arXiv 22 Oct 2025.

Builds on

31 of 51 references.

References · 31

  1. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
  2. 2016Adversarial Machine Learning at Scalecited by 936
  3. 2016Practical Black-Box Attacks against Machine Learningcited by 903
  4. 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 724
  5. 2017ZOO: Zeroth Order Optimization based Black-box Attacks to Deep Neural Networks without Training Substitute Modelscited by 666
  6. 2016Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Lojasiewicz Conditioncited by 539
  7. 2023Fine-Tuning Language Models with Just Forward Passescited by 345
  8. 2013Optimal rates for zero-order convex optimization: the power of two function evaluationscited by 198
  9. 2020Better Theory for SGD in the Nonconvex Worldcited by 158
  10. 2020Random Reshuffling: Simple Analysis with Vast Improvementscited by 115
  11. 2024Revisiting Zeroth-Order Optimization for Memory-Efficient LLM Fine-Tuning: A Benchmarkcited by 114
  12. 2019A Theoretical and Empirical Comparison of Gradient Approximations in Derivative-Free Optimizationcited by 68
19 more
  1. 2024Variance-reduced Zeroth-Order Methods for Fine-Tuning Language Modelscited by 54
  2. 2018Structured Evolution with Compact Architectures for Scalable Policy Optimizationcited by 48
  3. 2019Improved Zeroth-Order Variance Reduced Algorithms and Analysis for Nonconvex Optimizationcited by 47
  4. 2020Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Samplingcited by 46
  5. 2021A Zeroth-Order Block Coordinate Descent Algorithm for Huge-Scale Black-Box Optimizationcited by 46
  6. 2022Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimizationcited by 43
  7. 2021A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensionscited by 39
  8. 2024Zeroth-Order Fine-Tuning of LLMs with Extreme Sparsitycited by 28
  9. 2016Highly-Smooth Zero-th Order Online Optimization Vianney Perchetcited by 23
  10. 2023An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimizationcited by 23
  11. 2021Zeroth order optimization with orthogonal random directionscited by 21
  12. 2020A stochastic subspace approach to gradient-free optimization in high dimensionscited by 16
  13. 2020A One-bit, Comparison-Based Gradient Estimatorcited by 16
  14. 2018Towards Gradient Free and Projection Free Stochastic Optimizationcited by 15
  15. 2024Memory-Efficient Gradient Unrolling for Large-Scale Bi-level Optimizationcited by 11
  16. 2023An Optimal Structured Zeroth-order Algorithm for Non-smooth Optimizationcited by 10
  17. 2022Stochastic Zeroth order Descent with Structured Directionscited by 8
  18. 2022A gradient estimator via L1-randomization for online zero-order optimization with two point feedbackcited by 7
  19. 2020Gradient and Hessian approximations in Derivative Free Optimizationcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 9.

11 papers.