Trust the Direction, Search the Step: Zero-and-First-Order Methods for LLM Fine-Tuning
Not on the map. Why?
Abstract (arXiv)
Step-size selection remains a central challenge in large-scale neural network optimization; conservative steps slow convergence, while aggressive steps can destabilize it. We combine Zero-and-First-Order optimization~(ZFO) and propose a lightweight framework that decouples direction selection from step-size. ZFO uses a trusted first-order optimizer to determine the direction and performs zeroth-order evaluations only along this one-dimensional subspace to choose how far to move. Using the current gradient information and two additional objective function evaluations, ZFO instances construct a local model of the objective function along the proposed direction and select a curvature-aware step within a bounded search interval. This yields an adaptive step-selection mechanism that costs less than a full line search. We provide theoretical guarantees to show that shared-sample evaluations produce reliable finite-difference curvature estimates, that the induced local model selects a near-optimal step along the search interval, and that ZFO converges to a neighborhood of a stationary point. Across the evaluated settings, language models and datasets, ZFO frequently improves optimization and final performance relative to fixed-step first-order baselines, with the magnitude and preferred local model depending on the objective. Our code is publicly available at: https://github.com/nizswan/Zeroth-First-Order-Framework.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 41 of its 55 references that are in the map. First posted on arXiv 1 Oct 2026.
Builds on
41 of 55 references.
References · 41
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2015Trust Region Policy Optimizationcited by 2,580
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,998
- 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,492
- 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 878
29 more
- 2021Did Aristotle Use a Laptop? A Question Answering Benchmark with Implicit Reasoning Strategiescited by 743
- 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 724
- 2015Cyclical Learning Rates for Training Neural Networkscited by 629
- 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 427
- 2015Gradient-based Hyperparameter Optimization through Reversible Learningcited by 360
- 2023Fine-Tuning Language Models with Just Forward Passescited by 345
- 2021A Diverse Corpus for Evaluating and Developing English Math Word Problem Solverscited by 318
- 2022FOLIO: Natural Language Reasoning with First-Order Logiccited by 235
- 2018A disciplined approach to neural network hyper-parameters: Part 1 -- learning rate, batch size, momentum, and weight decaycited by 226
- 2017Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradientscited by 139
- 2023Prodigy: An Expeditiously Adaptive Parameter-Free Learnercited by 133
- 2024Revisiting Zeroth-Order Optimization for Memory-Efficient LLM Fine-Tuning: A Benchmarkcited by 114
- 2025Overtrained Language Models Are Harder to Fine-Tunecited by 58
- 2024Sparse MeZO: Less Parameters for Better Performance in Zeroth-Order LLM Fine-Tuningcited by 54
- 2024Second-Order Fine-Tuning without Pain for LLMs:A Hessian Informed Zeroth-Order Optimizercited by 53
- 2018Zeroth-order Nonconvex Stochastic Optimization: Handling Constraints, High-Dimensionality and Saddle-Pointscited by 37
- 2015Probabilistic Line Searches for Stochastic Optimizationcited by 29
- 2019Stochastic Three Points Method for Unconstrained Smooth Minimizationcited by 24
- 2024Gradient Compressed Sensing: A Query-Efficient Gradient Estimator for High-Dimensional Zeroth-Order Optimizationcited by 12
- 2026Learning Rate Matters: Vanilla LoRA May Suffice for LLM Fine-tuningcited by 10
- 2019A Stochastic Derivative-Free Optimization Method with Importance Sampling: Theory and Learning to Controlcited by 9
- 2019A Stochastic Derivative Free Optimization Method with Momentumcited by 9
- 2024Gradient descent with generalized Newton's methodcited by 9
- 2021Curvature-Aware Derivative-Free Optimizationcited by 7
- 2025Zeroth-Order Optimization is Secretly Single-Step Policy Optimizationcited by 7
- 2022Minibatch Stochastic Three Points Method for Unconstrained Smooth Minimizationcited by 6
- 2025On the optimization dynamics of RLVR: Gradient gap and step size thresholdscited by 4
- 2023Demystifying the Myths and Legends of Nonconvex Convergence of SGDcited by 2
- 2025Stabilizing Policy Gradient Methods via Reward Profilingcited by 1
Built on by
Not cited yet.