Revisiting Zeroth-Order Optimization: Minimum-Variance Two-Point Estimators and Directionally Aligned Perturbations
Shaocong Ma, Heng Huang
Abstract
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.
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 27c2253b-a617-4a4f-b4c1-d8203c719ddfCited by top-tier papers11
- Downgrade to Upgrade: Optimizer Simplification Enhances Robustness in LLM UnlearningYicheng Lang, Yihua Zhang, Chongyu Fan, Changsheng Wang et al.ICLR 2026 · 4 citations
- On the Optimal Construction of Unbiased Gradient Estimators for Zeroth-Order OptimizationShaocong Ma, Heng HuangNeurIPS 2025 · 4 citations
- Converge Faster, Talk Less: Hessian-Informed Federated Zeroth-Order OptimizationZhe Li, Bicheng Ying, Zidong Liu, Chaosheng Dong et al.ICLR 2026 · 3 citations
- Unveiling m-Sharpness Through the Structure of Stochastic Gradient NoiseHaocheng Luo, Mehrtash Harandi, Dinh Phung, Trung LeNeurIPS 2025 · 2 citations
- Private Zeroth-Order Optimization with Public DataXuchen Gong, Tian LiNeurIPS 2025 · 2 citations
Builds on11
- Fine-Tuning Language Models with Just Forward PassesSadhika Malladi, Tianyu Gao, Eshaan Nichani, Alex Damian et al.NeurIPS 2023 · 495 citations
- Random Reshuffling: Simple Analysis with Vast ImprovementsKonstantin Mishchenko, Ahmed Khaled, Peter RichtárikNeurIPS 2020 · 172 citations
- Revisiting Zeroth-Order Optimization for Memory-Efficient LLM Fine-Tuning: A BenchmarkYihua Zhang, Pingzhi Li, Junyuan Hong, Jiaxiang Li et al.ICML 2024 · 134 citations
- Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex OptimizationTianyi Lin, Zeyu Zheng, Michael I. JordanNeurIPS 2022 · 102 citations
- Complexity of Finding Stationary Points of Nonconvex Nonsmooth FunctionsJingzhao Zhang, Hongzhou Lin, Stefanie Jegelka, Suvrit Sra et al.ICML 2020 · 98 citations
Related papers
- Practical Sharpness-Aware Minimization Cannot Converge All the Way to OptimaDongkuk Si, Chulhee YunNeurIPS 2023 · 34 citations
- Zeroth-Order Methods for Nonconvex Stochastic Problems with Decision-Dependent DistributionsYuya Hikima, Akiko TakedaAAAI 2025
- Guided Zeroth-Order Methods for Stochastic Non-convex Problems with Decision-Dependent DistributionsYuya Hikima, Hiroshi Sawada, Akinori FujinoICML 2025
- Zeroth-Order Optimization Finds Flat MinimaLiang Zhang, Bingcong Li, Kiran Koshy Thekumparampil, Sewoong Oh et al.NeurIPS 2025 · 8 citations
- Min-Max Optimization without Gradients: Convergence and Applications to Black-Box Evasion and Poisoning AttacksSijia Liu, Songtao Lu, Xiangyi Chen, Yao Feng et al.ICML 2020 · 68 citations
