mlsanityData to 7 Oct 2026

LORENZA: Enhancing Generalization in Low-Rank Gradient LLM Training via Efficient Zeroth-Order Adaptive SAM

arXiv 2502.19571 ↗First posted 26 Feb 2025cs.LG math.OC stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

We study robust parameter-efficient fine-tuning (PEFT) techniques designed to improve accuracy and generalization while operating within strict computational and memory hardware constraints, specifically focusing on large-language models (LLMs). Existing PEFT methods often lack robustness and fail to generalize effectively across diverse tasks, leading to suboptimal performance in real-world scenarios. To address this, we present a new highly computationally efficient framework called AdaZo-SAM, combining Adam and Sharpness-Aware Minimization (SAM) while requiring only a single-gradient computation in every iteration. This is achieved using a stochastic zeroth-order estimation to find SAM's ascent perturbation. We provide a convergence guarantee for AdaZo-SAM and show that it improves the generalization ability of state-of-the-art PEFT methods. Additionally, we design a low-rank gradient optimization method named LORENZA, which is a memory-efficient version of AdaZo-SAM. LORENZA utilizes a randomized SVD scheme to efficiently compute the subspace projection matrix and apply optimization steps onto the selected subspace. This technique enables full-parameter fine-tuning with adaptive low-rank gradient updates, achieving the same reduced memory consumption as gradient-low-rank-projection methods. We provide a convergence analysis of LORENZA and demonstrate its merits for pre-training and fine-tuning LLMs.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 59 of its 82 references that are in the map. First posted on arXiv 26 Feb 2025.

Builds on

59 of 82 references.

References · 59

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  2. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  4. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  5. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  6. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  7. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  8. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  9. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  10. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  11. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  12. 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,718
38 more
  1. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
  2. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  3. 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 896
  4. 2017Crowdsourcing Multiple Choice Science Questionscited by 742
  5. 2019MathQA: Towards Interpretable Math Word Problem Solving with Operation-Based Formalismscited by 653
  6. 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 447
  7. 2023Fine-Tuning Language Models with Just Forward Passescited by 337
  8. 2013Optimal rates for zero-order convex optimization: the power of two function evaluationscited by 190
  9. 2022Surrogate Gap Minimization Improves Sharpness-Aware Trainingcited by 171
  10. 2020A Primer on Zeroth-Order Optimization in Signal Processing and Machine Learningcited by 160
  11. 2023Full Parameter Fine-tuning for Large Language Models with Limited Resourcescited by 134
  12. 2024Adam-mini: Use Fewer Learning Rates To Gain Morecited by 134
  13. 2024Flora: Low-Rank Adapters Are Secretly Gradient Compressorscited by 103
  14. 2023A Spectral Condition for Feature Learningcited by 101
  15. 2023Memory-Efficient Fine-Tuning of Compressed Large Language Models via sub-4-bit Integer Quantizationcited by 97
  16. 2023DeepZero: Scaling up Zeroth-Order Optimization for Deep Model Trainingcited by 76
  17. 2017Training Quantized Nets: A Deeper Understandingcited by 74
  18. 2020Understanding Self-supervised Learning with Dual Deep Networkscited by 62
  19. 2024Understanding LLMs: A Comprehensive Overview from Training to Inferencecited by 58
  20. 2023Memory Efficient Optimizers with 4-bit Statescited by 54
  21. 2021A Zeroth-Order Block Coordinate Descent Algorithm for Huge-Scale Black-Box Optimizationcited by 46
  22. 2020Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Samplingcited by 45
  23. 2022Improving Sharpness-Aware Minimization with Fisher Mask for Better Generalization on Language Modelscited by 42
  24. 2024Fira: Can We Achieve Full-rank Training of LLMs Under Low-rank Constraint?cited by 39
  25. 2024Q-GaLore: Quantized GaLore with INT4 Projection and Layer-Adaptive Low-Rank Gradientscited by 36
  26. 2023Revisiting the Noise Model of Stochastic Gradient Descentcited by 35
  27. 2024LDAdam: Adaptive Optimization from Low-Dimensional Gradient Statisticscited by 35
  28. 2023AdaLomo: Low-memory Optimization with Adaptive Learning Ratecited by 30
  29. 2021ZerO Initialization: Initializing Neural Networks with only Zeros and Onescited by 28
  30. 2020Quantized Adam with Error Feedbackcited by 27
  31. 2021On the Convergence of Prior-Guided Zeroth-Order Optimization Algorithmscited by 23
  32. 2020Low-rank Gradient Approximation For Memory-Efficient On-device Training of Deep Neural Networkcited by 20
  33. 2023Practical Sharpness-Aware Minimization Cannot Converge All the Way to Optimacited by 20
  34. 2024PeriodicLoRA: Breaking the Low-Rank Bottleneck in LoRA Optimizationcited by 19
  35. 2024Knowledge Editing in Language Models via Adapted Direct Preference Optimizationcited by 17
  36. 2023Sharpness-Aware Minimization Revisited: Weighted Sharpness as a Regularization Termcited by 16
  37. 2024AdaRankGrad: Adaptive Gradient-Rank and Moments for Memory-Efficient LLMs Training and Fine-Tuningcited by 16
  38. 2022Randomized Sharpness-Aware Training for Boosting Computational Efficiency in Deep Learningcited by 14

50 most cited of 59 All 59 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

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

3 papers.