Zero-order Parameter-free Optimization for LMO-based Methods: Novel Approach for Efficient Fine-tuning
Not on the map. Why?
Abstract (arXiv)
Fine-tuning large language models (LLMs) has become a central application of modern optimization, enabling pretrained models to adapt to diverse downstream tasks and domain-specific data. A major obstacle in large-scale fine-tuning is the memory overhead of backpropagation, which requires storing activations, gradients, and optimizer states. Zeroth-order (ZO) optimization offers a memory-efficient alternative, but its performance is highly sensitive to the stepsize and smoothing parameter, often requiring costly task-specific tuning. Parameter-free (PF) optimization addresses this issue by adapting algorithmic parameters without prior knowledge of problem-dependent constants. Moreover, large-scale fine-tuning can benefit from geometry-aware updates that account for the heterogeneous structure of parameter blocks, which can be modeled through methods that exploit linear minimization oracle (LMO). In this work, we study PF adaptation for LMO-based ZO optimization and introduce textttAdaNAGED, a method that unifies gradient-free training, adaptive tuning, and non-Euclidean update geometry. We establish convergence guarantees and validate the method on large-scale LLM fine-tuning task with textttOPT-1.3B model.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 71 of its 92 references that are in the map. First posted on arXiv 12 Jun 2026.
Builds on
71 of 92 references.
References · 71
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
- 2020Don't Stop Pretraining: Adapt Language Models to Domains and Taskscited by 1,548
- 2019ZeRO: Memory Optimizations Toward Training Trillion Parameter Modelscited by 1,278
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2019DialoGPT: Large-Scale Generative Pre-training for Conversational Response Generationcited by 842
- 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
- 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 561
- 2019Online Learning: A Modern Introduction Using Convex Optimizationcited by 407
- 20218-bit Optimizers via Block-wise Quantizationcited by 395
38 more
- 2023Fine-Tuning Language Models with Just Forward Passescited by 337
- 2019Error Feedback Fixes SignSGD and other Gradient Compression Schemescited by 306
- 2020Loss landscapes and optimization in over-parameterized non-linear systems and neural networkscited by 231
- 2013Optimal rates for zero-order convex optimization: the power of two function evaluationscited by 190
- 2025Training Deep Learning Models with Norm-Constrained LMOscited by 177
- 2024Old Optimizer, New Norm: An Anthologycited by 173
- 2017Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradientscited by 136
- 2020Momentum Improves Normalized SGDcited by 136
- 2016Coin Betting and Parameter-Free Online Learningcited by 131
- 2023Prodigy: An Expeditiously Adaptive Parameter-Free Learnercited by 129
- 2018Black-Box Reductions for Parameter-free Online Learning in Banach Spacescited by 124
- 2018An Alternative View: When Does SGD Escape Local Minima?cited by 115
- 2023Learning-Rate-Free Learning by D-Adaptationcited by 113
- 2024Revisiting Zeroth-Order Optimization for Memory-Efficient LLM Fine-Tuning: A Benchmarkcited by 113
- 2018Zeroth-Order Stochastic Variance Reduction for Nonconvex Optimizationcited by 109
- 2023DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedulecited by 85
- 2019Unified Optimal Analysis of the (Stochastic) Gradient Methodcited by 81
- 2019Adaptive Gradient Descent without Descentcited by 79
- 2019ZO-AdaMM: Zeroth-Order Adaptive Momentum Method for Black-Box Optimizationcited by 75
- 2025NorMuon: Making Muon more efficient and scalablecited by 74
- 2024LoRA-Pro: Are Low-Rank Adapters Properly Optimized?cited by 70
- 2025Gluon: Making Muon & Scion Great Again! (Bridging Theory and Practice of LMO-based Optimizers for LLMs)cited by 66
- 2025AdaMuon: Adaptive Muon Optimizercited by 59
- 2024Second-Order Fine-Tuning without Pain for LLMs:A Hessian Informed Zeroth-Order Optimizercited by 51
- 2022Making SGD Parameter-Freecited by 50
- 2024Variance-reduced Zeroth-Order Methods for Fine-Tuning Language Modelscited by 50
- 2024Enhancing Zeroth-order Fine-tuning for Language Models with Low-rank Structurescited by 48
- 2019Improved Zeroth-Order Variance Reduced Algorithms and Analysis for Nonconvex Optimizationcited by 47
- 2014Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximationscited by 46
- 2019SGD Converges to Global Minimum in Deep Learning via Star-convex Pathcited by 39
- 2020The Geometry of Sign Gradient Descentcited by 39
- 2023DoWG Unleashed: An Efficient Universal Parameter-Free Gradient Descent Methodcited by 35
- 2023SGD with AdaGrad Stepsizes: Full Adaptivity with High Probability to Unknown Parameters, Unbounded Gradients and Affine Variancecited by 30
- 2026Convergence of Muon with Newton-Schulzcited by 30
- 2020Statistically Preconditioned Accelerated Gradient Method for Distributed Optimizationcited by 29
- 2024BAdam: A Memory Efficient Full Parameter Optimization Method for Large Language Modelscited by 27
- 2023MoMo: Momentum Models for Adaptive Learning Ratescited by 24
- 2025LiMuon: Light and Fast Muon Optimizer for Large Modelscited by 20
50 most cited of 71 All 71 (JSON)
Built on by
Not cited yet.