Stochastic Two Points Method for Deep Model Zeroth-order Optimization
Not on the map. Why?
Abstract (arXiv)
Large foundation models, such as large language models, have performed exceptionally well in various application scenarios. Building or fully fine-tuning such large models is usually prohibitive due to either hardware budget or lack of access to backpropagation. The zeroth-order methods offer a promising direction for tackling this challenge, where only forward passes are needed to update the model. This paper introduces an efficient Stochastic Two-Point (S2P) approach within the gradient-free regime. We present the theoretical convergence properties of S2P under the general and relaxed smoothness assumptions, and the derived results help understand and inherently connect the two popular types of zeroth-order methods, basic random search and stochastic three-point method. The theoretical properties also shed light on a Variant of S2P (VS2P), through exploiting our new convergence properties that better represent the dynamics of deep models in training. Our comprehensive empirical results show that VS2P is highly effective in optimizing objectives for deep models. It outperforms or achieves competitive performance compared to standard methods across various model types and scales.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 39 of its 61 references that are in the map. First posted on arXiv 2 Feb 2024.
Builds on
39 of 61 references.
References · 39
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2016Densely Connected Convolutional Networkscited by 6,691
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2021On the Opportunities and Risks of Foundation Modelscited by 3,961
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
- 2019DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphscited by 883
- 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 716
27 more
- 2017Evolution Strategies as a Scalable Alternative to Reinforcement Learningcited by 555
- 2018Black-box Adversarial Attacks with Limited Queries and Informationcited by 499
- 2022RLPrompt: Optimizing Discrete Text Prompts with Reinforcement Learningcited by 361
- 2023Fine-Tuning Language Models with Just Forward Passescited by 337
- 2019Why gradient clipping accelerates training: A theoretical justification for adaptivitycited by 335
- 2019Simple Black-box Adversarial Attackscited by 249
- 2018ReCoRD: Bridging the Gap between Human and Machine Commonsense Reading Comprehensioncited by 198
- 2013Optimal rates for zero-order convex optimization: the power of two function evaluationscited by 190
- 2020On Hyperparameter Optimization of Machine Learning Algorithms: Theory and Practicecited by 181
- 2022GrIPS: Gradient-free, Edit-based Instruction Search for Prompting Large Language Modelscited by 127
- 2023Noise Is Not the Main Factor Behind the Gap Between SGD and Adam on Transformers, but Sign Descent Might Becited by 114
- 2015An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedbackcited by 105
- 2023Convergence of Adam Under Relaxed Assumptionscited by 97
- 2020Improved Analysis of Clipping Algorithms for Non-convex Optimizationcited by 88
- 2017Stochastic Zeroth-order Optimization in High Dimensionscited by 62
- 2023Convergence of AdaGrad for Non-convex Objectives: Simple Proofs and Relaxed Assumptionscited by 55
- 2018Structured Evolution with Compact Architectures for Scalable Policy Optimizationcited by 48
- 2020Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Samplingcited by 45
- 2020Recent Theoretical Advances in Non-Convex Optimizationcited by 30
- 2022Provable Adaptivity of Adam under Non-uniform Smoothnesscited by 30
- 2019Stochastic Three Points Method for Unconstrained Smooth Minimizationcited by 24
- 2023Just One Byte (per gradient): A Note on Low-Bandwidth Decentralized Language Model Finetuning Using Shared Randomnesscited by 18
- 2022Generalizing Gaussian Smoothing for Random Searchcited by 15
- 2020Learning to Guide Random Searchcited by 13
- 2021On the Second-order Convergence Properties of Random Search Methodscited by 5
- 2022Escaping saddle points in zeroth-order optimization: the power of two-point estimatorscited by 5
- 2020An Accelerated DFO Algorithm for Finite-sum Convex Functionscited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.