GRASS: Gradient-based Adaptive Layer-wise Importance Sampling for Memory-efficient Large Language Model Fine-tuning
Not on the map. Why?
Abstract (arXiv)
Full-parameter fine-tuning of large language models is constrained by substantial GPU memory requirements. Low-rank adaptation methods mitigate this challenge by updating only a subset of parameters. However, these approaches often limit model expressiveness and yield lower performance than full-parameter fine-tuning. Layer-wise fine-tuning methods have emerged as an alternative, enabling memory-efficient training through static layer importance sampling strategies. However, these methods overlook variations in layer importance across tasks and training stages, resulting in suboptimal performance on downstream tasks. To address these limitations, we propose GRASS, a gradient-based adaptive layer-wise importance sampling framework. GRASS utilizes mean gradient norms as a task-aware and training-stage-aware metric for estimating layer importance. Furthermore, GRASS adaptively adjusts layer sampling probabilities through an adaptive training strategy. We also introduce a layer-wise optimizer state offloading mechanism that overlaps computation and communication to further reduce memory usage while maintaining comparable training throughput. Extensive experiments across multiple models and benchmarks demonstrate that GRASS consistently outperforms state-of-the-art methods, achieving an average accuracy improvement of up to 4.38 points and reducing memory usage by up to 19.97%.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 23 of its 39 references that are in the map. First posted on arXiv 9 Apr 2026.
Builds on
23 of 39 references.
References · 23
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
- 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 863
11 more
- 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 861
- 2017Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problemscited by 642
- 2024TinyLlama: An Open-Source Small Language Modelcited by 604
- 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 447
- 2016Solving General Arithmetic Word Problemscited by 353
- 2023LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 317
- 2023ReLoRA: High-Rank Training Through Low-Rank Updatescited by 200
- 2014Stochastic Optimization with Importance Samplingcited by 91
- 2024Chain of LoRA: Efficient Fine-tuning of Language Models via Residual Learningcited by 80
- 2024Parameter-Efficient Fine-Tuning in Large Models: A Survey of Methodologiescited by 44
- 2025A Survey on Memory-Efficient Transformer-Based Model Training in AI for Sciencecited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.