MISA: Memory-Efficient LLMs Optimization with Module-wise Importance Sampling
Not on the map. Why?
Abstract (arXiv)
The substantial memory demands of pre-training and fine-tuning large language models (LLMs) require memory-efficient optimization algorithms. One promising approach is layer-wise optimization, which treats each transformer block as a single layer and optimizes it sequentially, while freezing the other layers to save optimizer states and activations. Although effective, these methods ignore the varying importance of the modules within each layer, leading to suboptimal performance. Moreover, layer-wise sampling provides only limited memory savings, as at least one full layer must remain active during optimization. To overcome these limitations, we propose Module-wise Importance SAmpling (MISA), a novel method that divides each layer into smaller modules and assigns importance scores to each module. MISA uses a weighted random sampling mechanism to activate modules, provably reducing gradient variance compared to layer-wise sampling. Additionally, we establish an (O(1/√K)) convergence rate under non-convex and stochastic conditions, where K is the total number of block updates, and provide a detailed memory analysis showcasing MISA's superiority over existing baseline methods. Experiments on diverse learning tasks validate the effectiveness of MISA. Source code is available at https://github.com/pkumelon/MISA.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 55 of its 70 references that are in the map. First posted on arXiv 28 Oct 2025.
Builds on
55 of 70 references.
References · 55
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
38 more
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
- 2023Mistral 7Bcited by 3,164
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,848
- 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 878
- 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 872
- 2016Training Deep Nets with Sublinear Memory Costcited by 848
- 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
- 2017Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problemscited by 650
- 2024TinyLlama: An Open-Source Small Language Modelcited by 618
- 2020Pre-trained Models for Natural Language Processing: A Surveycited by 505
- 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 463
- 2020MAD-X: An Adapter-Based Framework for Multi-Task Cross-Lingual Transfercited by 445
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 439
- 20218-bit Optimizers via Block-wise Quantizationcited by 403
- 2021Learning How to Ask: Querying LMs with Mixtures of Soft Promptscited by 377
- 2024LoRA Learns Less and Forgets Lesscited by 328
- 2023LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 324
- 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 307
- 2021Factual Probing Is [MASK]: Learning vs. Learning to Recallcited by 291
- 2021PTR: Prompt Tuning with Rules for Text Classificationcited by 238
- 2023Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessmentcited by 230
- 2015Coordinate Descent Algorithmscited by 219
- 2023ReLoRA: High-Rank Training Through Low-Rank Updatescited by 204
- 2024When Scaling Meets LLM Finetuning: The Effect of Data, Model and Finetuning Methodcited by 204
- 2022AdaMix: Mixture-of-Adaptations for Parameter-efficient Model Tuningcited by 137
- 2024Adam-mini: Use Fewer Learning Rates To Gain Morecited by 137
- 2023Full Parameter Fine-tuning for Large Language Models with Limited Resourcescited by 134
- 2024LISA: Layerwise Importance Sampling for Memory-Efficient Large Language Model Fine-Tuningcited by 89
- 2022SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapterscited by 83
- 2023Memory Efficient Optimizers with 4-bit Statescited by 54
- 2023AdaLomo: Low-memory Optimization with Adaptive Learning Ratecited by 31
- 2024BAdam: A Memory Efficient Full Parameter Optimization Method for Large Language Modelscited by 27
- 2014Block stochastic gradient iteration for convex and nonconvex optimizationcited by 22
- 2021Layer-wise Model Pruning based on Mutual Informationcited by 19
50 most cited of 55 All 55 (JSON)
Built on by
Citing papers per year: 2026: 2.
2 papers.