mlsanityData to 14 Oct 2026

MISA: Memory-Efficient LLMs Optimization with Module-wise Importance Sampling

arXiv 2511.00056 ↗First posted 28 Oct 2025cs.LG cs.AIcited by 2

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

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  3. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  4. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
  5. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  6. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
  7. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  8. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  9. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  10. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  11. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
  12. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
38 more
  1. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
  2. 2023Mistral 7Bcited by 3,164
  3. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  4. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
  5. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  6. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  7. 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,848
  8. 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 878
  9. 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 872
  10. 2016Training Deep Nets with Sublinear Memory Costcited by 848
  11. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
  12. 2017Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problemscited by 650
  13. 2024TinyLlama: An Open-Source Small Language Modelcited by 618
  14. 2020Pre-trained Models for Natural Language Processing: A Surveycited by 505
  15. 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 463
  16. 2020MAD-X: An Adapter-Based Framework for Multi-Task Cross-Lingual Transfercited by 445
  17. 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 439
  18. 20218-bit Optimizers via Block-wise Quantizationcited by 403
  19. 2021Learning How to Ask: Querying LMs with Mixtures of Soft Promptscited by 377
  20. 2024LoRA Learns Less and Forgets Lesscited by 328
  21. 2023LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 324
  22. 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 307
  23. 2021Factual Probing Is [MASK]: Learning vs. Learning to Recallcited by 291
  24. 2021PTR: Prompt Tuning with Rules for Text Classificationcited by 238
  25. 2023Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessmentcited by 230
  26. 2015Coordinate Descent Algorithmscited by 219
  27. 2023ReLoRA: High-Rank Training Through Low-Rank Updatescited by 204
  28. 2024When Scaling Meets LLM Finetuning: The Effect of Data, Model and Finetuning Methodcited by 204
  29. 2022AdaMix: Mixture-of-Adaptations for Parameter-efficient Model Tuningcited by 137
  30. 2024Adam-mini: Use Fewer Learning Rates To Gain Morecited by 137
  31. 2023Full Parameter Fine-tuning for Large Language Models with Limited Resourcescited by 134
  32. 2024LISA: Layerwise Importance Sampling for Memory-Efficient Large Language Model Fine-Tuningcited by 89
  33. 2022SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapterscited by 83
  34. 2023Memory Efficient Optimizers with 4-bit Statescited by 54
  35. 2023AdaLomo: Low-memory Optimization with Adaptive Learning Ratecited by 31
  36. 2024BAdam: A Memory Efficient Full Parameter Optimization Method for Large Language Modelscited by 27
  37. 2014Block stochastic gradient iteration for convex and nonconvex optimizationcited by 22
  38. 2021Layer-wise Model Pruning based on Mutual Informationcited by 19

50 most cited of 55 All 55 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.