MGAA: Multi-Granular Adaptive Allocation fof Low-Rank Compression of LLMs
Not on the map. Why?
Abstract (arXiv)
The enormous parameter scale of large language models (LLMs) has made model compression a research hotspot, which aims to alleviate computational resource demands during deployment and inference. As a promising direction, low-rank approximation technique has made remarkable achievements. Nevertheless, unfortunately, the vast majority of studies to low-rank approximation compression generally apply uniform compression ratios across all weight matrices, while disregarding their inherently differentiated impacts on the model's performance. Although a few recent work attempts to employ heuristic search strategies to achieve the optimal parameter allocation, such strategies are computationally inefficient and lose the generalization ability in the era of LLMs. In this study, we propose a novel parameter Multi-Granular Adaptive Allocation (MGAA) method, which can adaptively allocate parameters between and within sublayers without task-specific evaluations in the compression process. MGAA consists of two components: 1) Among different sublayers, it assigns compression ratios based on their cosine similarity between inputs and outputs, allowing for a more tailored compression in sublayers with varying degrees of importance, and 2) Within each sublayer, it allocates different compression ratios to weight matrices based on their energy distribution characteristics, ensuring a consistent energy retention ratio while optimizing compression efficiency. Comprehensive evaluations of MGAA across multiple LLMs backbone models and benchmark datasets demonstrate its superior performance. Additionally, we apply our MGAA to multimodal model LLaVA, exhibiting remarkable performance improvements.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 37 of its 52 references that are in the map. First posted on arXiv 4 Jul 2025.
Builds on
37 of 52 references.
References · 37
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2023Improved Baselines with Visual Instruction Tuningcited by 4,418
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2016Making the V in VQA Matter: Elevating the Role of Image Understanding in Visual Question Answeringcited by 2,516
- 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
25 more
- 2023MMMU: A Massive Multi-discipline Multimodal Understanding and Reasoning Benchmark for Expert AGIcited by 2,080
- 2022Learn to Explain: Multimodal Reasoning via Thought Chains for Science Question Answeringcited by 1,919
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
- 2019Towards VQA Models That Can Readcited by 1,718
- 2023MME: A Comprehensive Evaluation Benchmark for Multimodal Large Language Modelscited by 1,652
- 2022ChartQA: A Benchmark for Question Answering about Charts with Visual and Logical Reasoningcited by 1,479
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,386
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2018VizWiz Grand Challenge: Answering Visual Questions from Blind Peoplecited by 858
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2021InfographicVQAcited by 437
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
- 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 243
- 2022Language model compression with weighted low-rank factorizationcited by 195
- 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Modelscited by 169
- 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
- 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 111
- 2023SCOTT: Self-Consistent Chain-of-Thought Distillationcited by 105
- 2019AI2D-RST: A multimodal corpus of 1000 primary school science diagramscited by 60
- 2023LORD: Low Rank Decomposition Of Monolingual Code LLMs For One-Shot Compressioncited by 26
- 2022DeepTensor: Low-Rank Tensor Decomposition with Deep Network Priorscited by 15
- 2024LoRAP: Transformer Sub-Layers Deserve Differentiated Structured Compression for Large Language Modelscited by 12
- 2023Performance-aware Approximation of Global Channel Pruning for Multitask CNNscited by 9
- 2023Influence Function Based Second-Order Channel Pruning-Evaluating True Loss Changes For Pruning Is Possible Without Retrainingcited by 4
Built on by
Not cited yet.