Instruction-Following Pruning for Large Language Models
Not on the map. Why?
Abstract (arXiv)
With the rapid scaling of large language models (LLMs), structured pruning has become a widely used technique to learn efficient, smaller models from larger ones, delivering superior performance compared to training similarly sized models from scratch. In this paper, we move beyond the traditional static pruning approach of determining a fixed pruning mask for a model, and propose a dynamic approach to structured pruning. In our method, the pruning mask is input-dependent and adapts dynamically based on the information described in a user instruction. Our approach, termed "instruction-following pruning", introduces a sparse mask predictor that takes the user instruction as input and dynamically selects the most relevant model parameters for the given task. To identify and activate effective parameters, we jointly optimize the sparse mask predictor and the LLM, leveraging both instruction-following data and the pre-training corpus. Experimental results demonstrate the effectiveness of our approach on a wide range of evaluation benchmarks. For example, our 3B activated model improves over the 3B dense model by 5-8 points of absolute margin on domains such as math and coding, and rivals the performance of a 9B model.
Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 56 of its 66 references that are in the map. First posted on arXiv 3 Jan 2025.
Builds on
56 of 66 references.
References · 56
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2021Program Synthesis with Large Language Modelscited by 3,509
- 2016Gaussian Error Linear Units (GELUs)cited by 3,431
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2022Scaling Instruction-Finetuned Language Modelscited by 2,997
38 more
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2024Qwen2 Technical Reportcited by 2,076
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2020GLU Variants Improve Transformercited by 1,724
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
- 2023Instruction-Following Evaluation for Large Language Modelscited by 1,143
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,093
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
- 2017Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learningcited by 935
- 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 890
- 2024Length-Controlled AlpacaEval: A Simple Way to Debias Automatic Evaluatorscited by 865
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
- 2024DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Modelscited by 834
- 2017Crowdsourcing Multiple Choice Science Questionscited by 742
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2022Mixture-of-Experts with Expert Choice Routingcited by 611
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
- 2021The FLORES-101 Evaluation Benchmark for Low-Resource and Multilingual Machine Translationcited by 556
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
- 2024From Crowdsourced Data to High-Quality Benchmarks: Arena-Hard and BenchBuilder Pipelinecited by 484
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 408
- 2022ST-MoE: Designing Stable and Transferable Sparse Expert Modelscited by 391
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
- 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
- 2023Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Timecited by 247
- 2019Structured Pruning of Large Language Modelscited by 201
- 2024Compact Language Models via Pruning and Knowledge Distillationcited by 142
- 2022MultiPL-E: A Scalable and Extensible Approach to Benchmarking Neural Code Generationcited by 132
- 2024LaCo: Large Language Model Pruning via Layer Collapsecited by 124
- 2023ReLU Strikes Back: Exploiting Activation Sparsity in Large Language Modelscited by 91
- 2023CoLT5: Faster Long-Range Transformers with Conditional Computationcited by 84
- 2024LLM Pruning and Distillation in Practice: The Minitron Approachcited by 82
- 2024Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methodscited by 80
- 2017Exploring Sparsity in Recurrent Neural Networkscited by 75
- 2023Conditional Adapters: Parameter-efficient Transfer Learning with Fast Inferencecited by 69
- 2023ZipLM: Inference-Aware Structured Pruning of Language Modelscited by 46
- 2024ProSparse: Introducing and Enhancing Intrinsic Activation Sparsity within Large Language Modelscited by 43
50 most cited of 56 All 56 (JSON)
Built on by
Citing papers per year: 2025: 7; 2026: 7.
14 papers.
Sort:
By area:
- 2025KVLink: Accelerating Large Language Models via Efficient KV Cache Reusecited by 60
- 2025Get Experience from Practice: LLM Agents with Record & Replaycited by 22
- 2025DocPruner: A Storage-Efficient Framework for Multi-Vector Visual Document Retrieval via Adaptive Patch-Level Embedding Pruningcited by 19
- 2025Pretraining with hierarchical memories: separating long-tail and common knowledgecited by 13
- 2025Meeseeks: A Feedback-Driven, Iterative Self-Correction Benchmark evaluating LLMs' Instruction Following Capabilitycited by 3
- 2026A Survey on the Green Development of Large Models: From Resource-Efficient Architectures to Hardware-Software Co-Designcited by 3
- 2025Fragile Knowledge, Robust Instruction-Following: The Width Pruning Dichotomy in Llama-3.2cited by 2
- 2026Understanding Layer Patching in Model Size Interpolationcited by 1
- 2025Masked Gated Linear Unitcited by 0
- 2026POP: Online Structural Pruning Enables Efficient Inference of Large Foundation Modelscited by 0
- 2026Relative Kinetic Utility for Reasoning-Aware Structural Pruning in Large Language Modelscited by 0
- 2026Persona-Pruner: Sculpting Lightweight Models for Role-Playingcited by 0
- 2026Efficient Mixture-of-Experts with Speculative Decoding via Expert Coactivation18 Sep 2026
- 2026Memory Efficient Audio Synthesis with Decoupled Temporal Depth Diffusion Transformers26 Jul 2026
- 2026A Survey on the Green Development of Large Models: From Resource-Efficient Architectures to Hardware-Software Co-Design10 Jul 2026
- 2026Understanding Layer Patching in Model Size Interpolation9 Jul 2026
- 2026Persona-Pruner: Sculpting Lightweight Models for Role-Playing12 Jun 2026
- 2026Relative Kinetic Utility for Reasoning-Aware Structural Pruning in Large Language Models9 May 2026
- 2026POP: Online Structural Pruning Enables Efficient Inference of Large Foundation Models6 Feb 2026
- 2025Fragile Knowledge, Robust Instruction-Following: The Width Pruning Dichotomy in Llama-3.227 Dec 2025
- 2025Pretraining with hierarchical memories: separating long-tail and common knowledge29 Sep 2025
- 2025DocPruner: A Storage-Efficient Framework for Multi-Vector Visual Document Retrieval via Adaptive Patch-Level Embedding Pruning28 Sep 2025
- 2025Masked Gated Linear Unit29 Jun 2025
- 2025Get Experience from Practice: LLM Agents with Record & Replay23 May 2025
- 2025DocPruner: A Storage-Efficient Framework for Multi-Vector Visual Document Retrieval via Adaptive Patch-Level Embedding Pruningcited by 19
- 2025Pretraining with hierarchical memories: separating long-tail and common knowledgecited by 13
- 2025Meeseeks: A Feedback-Driven, Iterative Self-Correction Benchmark evaluating LLMs' Instruction Following Capabilitycited by 3
- 2026A Survey on the Green Development of Large Models: From Resource-Efficient Architectures to Hardware-Software Co-Designcited by 3
- 2025Fragile Knowledge, Robust Instruction-Following: The Width Pruning Dichotomy in Llama-3.2cited by 2
- 2026Understanding Layer Patching in Model Size Interpolationcited by 1
- 2025Masked Gated Linear Unitcited by 0
- 2026POP: Online Structural Pruning Enables Efficient Inference of Large Foundation Modelscited by 0
- 2026Persona-Pruner: Sculpting Lightweight Models for Role-Playingcited by 0
- 2026A Survey on the Green Development of Large Models: From Resource-Efficient Architectures to Hardware-Software Co-Design10 Jul 2026
- 2026Understanding Layer Patching in Model Size Interpolation9 Jul 2026
- 2026Persona-Pruner: Sculpting Lightweight Models for Role-Playing12 Jun 2026
- 2026POP: Online Structural Pruning Enables Efficient Inference of Large Foundation Models6 Feb 2026
- 2025Fragile Knowledge, Robust Instruction-Following: The Width Pruning Dichotomy in Llama-3.227 Dec 2025
- 2025Pretraining with hierarchical memories: separating long-tail and common knowledge29 Sep 2025
- 2025DocPruner: A Storage-Efficient Framework for Multi-Vector Visual Document Retrieval via Adaptive Patch-Level Embedding Pruning28 Sep 2025
- 2025Masked Gated Linear Unit29 Jun 2025
- 2025Meeseeks: A Feedback-Driven, Iterative Self-Correction Benchmark evaluating LLMs' Instruction Following Capability30 Apr 2025