Pruning Large Language Models to Intra-module Low-rank Architecture with Transitional Activations
Not on the map. Why?
Abstract (arXiv)
Structured pruning fundamentally reduces computational and memory overheads of large language models (LLMs) and offers a feasible solution for end-side LLM deployment. Structurally pruned models remain dense and high-precision, highly compatible with further tuning and compression. However, as the coarse-grained structured pruning poses large damage to the highly interconnected model, achieving a high compression ratio for scaled-up LLMs remains a challenge. In this paper, we introduce a task-agnostic structured pruning approach coupled with a compact Transformer architecture design. The proposed approach, named TransAct, reduces transitional activations inside multi-head attention (MHA) and multi-layer perceptron (MLP) modules, while preserving the inter-module activations that are sensitive to perturbations. Hence, the LLM is pruned into an intra-module low-rank architecture, significantly reducing weights, KV Cache and attention computation. TransAct is implemented on the LLaMA model and evaluated on downstream benchmarks. Results verify the optimality of our approach at high compression with respect to both efficiency and performance. Further, ablation studies reveal the strength of activation-guided iterative pruning and provide experimental analysis on the redundancy of MHA and MLP modules.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 31 of its 51 references that are in the map. First posted on arXiv 8 Jul 2024.
Builds on
31 of 51 references.
References · 31
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2021TruthfulQA: Measuring How Models Mimic Human Falsehoodscited by 2,919
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,895
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
19 more
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
- 2022BLOOM: A 176B-Parameter Open-Access Multilingual Language Modelcited by 1,968
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
- 2022Fast Inference from Transformers via Speculative Decodingcited by 1,615
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
- 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
- 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Headscited by 821
- 2017Crowdsourcing Multiple Choice Science Questionscited by 742
- 2021A White Paper on Neural Network Quantizationcited by 453
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 408
- 2020Retrieve, Program, Repeat: Complex Knowledge Base Question Answering via Alternate Meta-learningcited by 216
- 2023PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPUcited by 210
- 2023SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inferencecited by 89
- 2022An Algorithm-Hardware Co-Optimized Framework for Accelerating N:M Sparse Transformerscited by 28
- 2023PERP: Rethinking the Prune-Retrain Paradigm in the Era of LLMscited by 14
- 2023Relax: Composable Abstractions for End-to-End Dynamic Machine Learningcited by 12
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.
- 2026When Can Attention Heads Be Statically Defined?28 Sep 2026
- 2025SAP: Syntactic Attention Pruning for Transformer-based Language Models22 Dec 2025
Similar, not cited
Close in wording, no citation either way
- 2025From Local to Global: Revisiting Structured Pruning Paradigms for Large Language Models
- 2026Multi-Objective Structured Pruning of LLMs for Latency and Model Size Optimization
- 2024Beyond Linear Approximations: A Novel Pruning Approach for Attention Matrix
- 2023Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Models
- 2025Pruning Laws for Large Language Models
- 2025MaskPrune: Mask-based LLM Pruning for Layer-wise Uniform Structures
- 2025Investigating Structural Pruning and Recovery Techniques for Compressing Multimodal Large Language Models: An Empirical Study
- 2024Streamlining Redundant Layers to Compress Large Language Models