AGZO: Activation-Guided Zeroth-Order Optimization for LLM Fine-Tuning
Not on the map. Why?
Abstract (arXiv)
Zeroth-Order (ZO) optimization has emerged as a promising solution for fine-tuning LLMs under strict memory constraints, as it avoids the prohibitive memory cost of storing activations for backpropagation. However, existing ZO methods typically employ isotropic perturbations, neglecting the rich structural information available during the forward pass. In this paper, we identify a crucial link between gradient formation and activation structure: the gradient of a linear layer is confined to the subspace spanned by its input activations. Leveraging this insight, we propose Activation-Guided Zeroth-Order optimization (AGZO). Unlike prior methods, AGZO extracts a compact, activation-informed subspace on the fly during the forward pass and restricts perturbations to this low-rank subspace. We provide a theoretical framework showing that AGZO optimizes a subspace-smoothed objective and provably yields update directions with higher cosine similarity to the true gradient than isotropic baselines. Empirically, we evaluate AGZO on Qwen3 and Pangu models across various benchmarks. AGZO consistently outperforms state-of-the-art ZO baselines and significantly narrows the performance gap with first-order fine-tuning, while maintaining almost the same peak memory footprint as other ZO methods.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 29 of its 42 references that are in the map. First posted on arXiv 24 Jan 2026.
Builds on
29 of 42 references.
References · 29
- 2017Attention Is All You Needcited by 59,932
- 2022Training language models to follow instructions with human feedbackcited by 15,712
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2025Qwen3 Technical Reportcited by 8,195
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,718
- 2018Spectral Normalization for Generative Adversarial Networkscited by 1,618
- 2019ZeRO: Memory Optimizations Toward Training Trillion Parameter Modelscited by 1,278
- 2019DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphscited by 883
17 more
- 2016Training Deep Nets with Sublinear Memory Costcited by 825
- 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 716
- 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 658
- 2018WiC: the Word-in-Context Dataset for Evaluating Context-Sensitive Meaning Representationscited by 370
- 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 364
- 2023Fine-Tuning Language Models with Just Forward Passescited by 337
- 2022Black-Box Tuning for Language-Model-as-a-Servicecited by 254
- 2018Gradient Descent Happens in a Tiny Subspacecited by 208
- 2013Optimal rates for zero-order convex optimization: the power of two function evaluationscited by 190
- 2024Revisiting Zeroth-Order Optimization for Memory-Efficient LLM Fine-Tuning: A Benchmarkcited by 113
- 2024Flora: Low-Rank Adapters Are Secretly Gradient Compressorscited by 103
- 2020Traces of Class/Cross-Class Structure Pervade Deep Learning Spectracited by 94
- 2023DeepZero: Scaling up Zeroth-Order Optimization for Deep Model Trainingcited by 76
- 2025Pangu Embedded: An Efficient Dual-system LLM Reasoner with Metacognitioncited by 61
- 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
- 2025Revealing the Power of Post-Training for Small Language Models via Knowledge Distillationcited by 6
Built on by
Citing papers per year: 2026: 3.
3 papers.