Movement Pruning: Adaptive Sparsity by Fine-Tuning
Not on the map. Why?
Cited by 21 in Efficient LLM inference and serving, but placed by its own abstract, which didn’t fit.
Abstract (arXiv)
Magnitude pruning is a widely used strategy for reducing model size in pure supervised learning; however, it is less effective in the transfer learning regime that has become standard for state-of-the-art natural language processing applications. We propose the use of movement pruning, a simple, deterministic first-order weight pruning method that is more adaptive to pretrained model fine-tuning. We give mathematical foundations to the method and compare it to existing zeroth- and first-order pruning methods. Experiments show that when pruning large pretrained language models, movement pruning shows significant improvements in high-sparsity regimes. When combined with distillation, the approach achieves minimal accuracy loss with down to only 3% of the model parameters.
Key facts. Cited by 398 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 May 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 47; 2022: 60; 2023: 100; 2024: 75; 2025: 68; 2026: 48.
398 papers.
Sort:
By area:
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2021Scaling Language Models: Methods, Analysis & Insights from Training Gophercited by 1,199
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 700
- 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertaintycited by 564
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 408
- 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Treescited by 362
- 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 337
- 2023SqueezeLLM: Dense-and-Sparse Quantizationcited by 285
- 2021I-BERT: Integer-only BERT Quantizationcited by 250
- 2021SPoT: Better Frozen Model Adaptation through Soft Prompt Transfercited by 235
38 more
- 2023Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessmentcited by 227
- 2024Assessing the Brittleness of Safety Alignment via Pruning and Low-Rank Modificationscited by 220
- 2023DepGraph: Towards Any Structural Pruningcited by 202
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2023Structural Pruning for Diffusion Modelscited by 193
- 2021Block Pruning For Faster Transformerscited by 176
- 2022Structured Pruning Learns Compact and Accurate Modelscited by 167
- 2021SPViT: Enabling Faster Vision Transformers via Soft Token Pruningcited by 165
- 2023Speculative Decoding with Big Little Decodercited by 163
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
- 2022A Fast Post-Training Pruning Framework for Transformerscited by 161
- 2022On the Effectiveness of Parameter-Efficient Fine-Tuningcited by 140
- 2021Understanding and Overcoming the Challenges of Efficient Transformer Quantizationcited by 139
- 2021Learned Token Pruning for Transformerscited by 138
- 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
- 2023Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policycited by 104
- 2023LoSparse: Structured Compression of Large Language Models based on Low-Rank and Sparse Approximationcited by 103
- 2023Towards Efficient Generative Large Language Model Serving: A Survey from Algorithms to Systemscited by 101
- 2022Monarch: Expressive Structured Matrices for Efficient and Accurate Trainingcited by 100
- 2021Learning Compact Metrics for MTcited by 93
- 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
- 2023Modular Deep Learningcited by 82
- 2022PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importancecited by 79
- 2023Full Stack Optimization of Transformer Inference: a Surveycited by 79
- 2022Efficient Methods for Natural Language Processing: A Surveycited by 78
- 2021Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Modelscited by 75
- 2021Only Train Once: A One-Shot Neural Network Training And Pruning Frameworkcited by 70
- 2021Prune Once for All: Sparse Pre-Trained Language Modelscited by 66
- 2023X-Pruner: eXplainable Pruning for Vision Transformerscited by 66
- 2021Low-Complexity Probing via Finding Subnetworkscited by 63
- 2022Client Selection in Federated Learning: Principles, Challenges, and Opportunitiescited by 62
- 2023Simple Hardware-Efficient Long Convolutions for Sequence Modelingcited by 62
- 2024Model Compression and Efficient Inference for Large Language Models: A Surveycited by 62
- 2023Compressing LLMs: The Truth is Rarely Pure and Never Simplecited by 59
- 2022EfficientVLM: Fast and Accurate Vision-Language Models via Knowledge Distillation and Modal-adaptive Pruningcited by 56
- 2022Outliers Dimensions that Disrupt Transformers Are Driven by Frequencycited by 55
- 2023LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuningcited by 53
- 2021A Survey on Green Deep Learningcited by 52
50 most cited of 398 All 398 (JSON)
- 2026Are We Recovering Mechanisms? Objective-Level Recovery Gaps in Mechanistic Interpretability1 Oct 2026
- 2026Learning Functional Subspaces for Neural Network Compression30 Sep 2026
- 2026Output-aware Residual Stream Pruning for Large Language Models28 Sep 2026
- 2026GroupMask: Layer-Adaptive Group-wise Sparsity for Semi-Structured LLM Pruning27 Sep 2026
- 2026PruneForget: Joint Unlearning and Pruning of Vision Models26 Sep 2026
- 2026Unified Response Geometry for Structured Pruning16 Sep 2026
- 2026OBC-Prune: Outcome-Based Calibration for Large Reasoning Model Pruning15 Sep 2026
- 2026Dense to MoE Adaptation for Compact Vision Language Action Policies15 Sep 2026
- 2026Training Trajectories Determine Circuit Removability in Annealable Soft-Prior Transformers9 Sep 2026
- 2026Dense Structural Compression of Transformers via Gauge-Correct Channel Removal7 Sep 2026
- 2026PruneShift: A Framework for Evaluating Decision Reliability in Structured Pruning30 Aug 2026
- 2026Cut-ViT: Task-Specific Model Pruning via Gram Anchoring Subspace Consistency28 Aug 2026
38 more
- 2026Task-Aware Spectral Pruning: A Mixture-of-Masks Framework for Efficient LLM Inference24 Aug 2026
- 2026Mixture of Channel Experts: Static Sparse Supports with Input-Adaptive Mixing for Pointwise Projections24 Aug 2026
- 2026COEC: Calibrated Orthogonal-Equivalence Compensation for Structured Pruning of Large Language Models21 Aug 2026
- 2026Can Neural Networks Learn by Experimenting on Themselves? Self-Interventional Learning from Functional Consequences to Predictive Self-Knowledge14 Aug 2026
- 2026Fast LapSum: Exact Differentiable Top-k at Million Scale7 Aug 2026
- 2026Double-Scoring: Reliable Extraction of Strong Lottery Tickets15 Jul 2026
- 2026Adaptive Inference Batching using Policy Gradients6 Jul 2026
- 2026Compositionality Emerges in a Narrow Depth-Connectivity Regime: Architecture Constraints and Solution Manifolds18 Jun 2026
- 2026Neural Network Compression by Approximate Differential Equivalence31 May 2026
- 2026Accelerating Vision Foundation Models with Drop-in Depthwise Convolution21 May 2026
- 2026HodgeCover: Higher-Order Topological Coverage Drives Compression of Sparse Mixture-of-Experts13 May 2026
- 2026MedCore: Boundary-Preserving Medical Core Pruning for MedSAM13 May 2026
- 2026Not How Many, But Which: Parameter Placement in Low-Rank Adaptation12 May 2026
- 2026DiBA: Diagonal and Binary Matrix Approximation for Neural Network Weight Compression7 May 2026
- 2026Budgeted Attention Allocation: Cost-Conditioned Compute Control for Efficient Transformers7 May 2026
- 2026Budgeted LoRA: Distillation as Structured Compute Allocation for Efficient Inference5 May 2026
- 2026Carbon-Taxed Transformers: A Green Compression Pipeline for Overgrown Language Models28 Apr 2026
- 2026Structural Pruning of Large Vision Language Models: A Comprehensive Study on Pruning Dynamics, Recovery, and Data Efficiency27 Apr 2026
- 2026Route-Induced Density and Stability (RIDE): Controlled Intervention and Mechanism Analysis of Routing-Style Meta Prompts on LLM Internal States31 Mar 2026
- 2026Sparse-by-Design Cross-Modality Prediction: L0-Gated Representations for Reliable and Efficient Learning26 Mar 2026
- 2026An Adapter-free Fine-tuning Approach for Tuning 3D Foundation Models24 Mar 2026
- 2026DynamicGate MLP Conditional Computation via Learned Structural Dropout and Input Dependent Gating for Functional Plasticity17 Mar 2026
- 2026Multi-DNN Inference of Sparse Models on Edge SoCs10 Mar 2026
- 2026Uncovering a Winning Lottery Ticket with Continuously Relaxed Bernoulli Gates9 Mar 2026
- 2026Bias In, Bias Out? Finding Unbiased Subnetworks in Vanilla Models5 Mar 2026
- 2026FastLightGen: Fast and Light Video Generation with Fewer Steps and Parameters2 Mar 2026
- 2026Elimination-compensation pruning for fully-connected neural networks24 Feb 2026
- 2026Cut Less, Fold More: Model Compression through the Lens of Projection Geometry20 Feb 2026
- 2026TabAgent: A Framework for Replacing Agentic Generative Components with Tabular-Textual Classifiers18 Feb 2026
- 2026Train Less, Infer Faster: Efficient Model Finetuning and Compression via Structured Sparsity9 Feb 2026
- 2026Efficient Post-Training Pruning of Large Language Models with Statistical Correction7 Feb 2026
- 2026CORP: Closed-Form One-shot Representation-Preserving Structured Pruning for Transformers5 Feb 2026
- 2026Topology-Aware Revival for Efficient Sparse Training4 Feb 2026
- 2026FlexLoRA: Entropy-Guided Flexible Low-Rank Adaptation30 Jan 2026
- 2026Ability Transfer and Recovery via Modularized Parameters Localization14 Jan 2026
- 2026T3C: Test-Time Tensor Compression with Consistency Guarantees3 Jan 2026
- 2025FlashVLM: Text-Guided Visual Token Selection for Large Multimodal Models23 Dec 2025
- 2025HEART-VIT: Hessian-Guided Efficient Dynamic Attention and Token Pruning in Vision Transformer23 Dec 2025
50 newest of 398 All 398 (JSON)
- 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Treescited by 362
- 2021SPViT: Enabling Faster Vision Transformers via Soft Token Pruningcited by 165
- 2023Speculative Decoding with Big Little Decodercited by 163
- 2021Learned Token Pruning for Transformerscited by 138
- 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
- 2023Towards Efficient Generative Large Language Model Serving: A Survey from Algorithms to Systemscited by 101
- 2023Sparse Fine-tuning for Inference Acceleration of Large Language Modelscited by 14
- 2024Optimized Multi-Token Joint Decoding with Auxiliary Model for LLM Inferencecited by 11
- 2025Gumiho: A Hybrid Architecture to Prioritize Early Tokens in Speculative Decodingcited by 9
- 2023Constraint-aware and Ranking-distilled Token Pruning for Efficient Transformer Inferencecited by 6
- 2024Accelerating ViT Inference on FPGA through Static and Dynamic Pruningcited by 5
- 2024Cross-layer Attention Sharing for Pre-trained Large Language Modelscited by 5
12 most cited of 19 All 19 (JSON)
- 2026Task-Aware Spectral Pruning: A Mixture-of-Masks Framework for Efficient LLM Inference24 Aug 2026
- 2025HEART-VIT: Hessian-Guided Efficient Dynamic Attention and Token Pruning in Vision Transformer23 Dec 2025
- 2025NeuronMLP: Efficient LLM Inference via Singular Value Decomposition Compression and Tiling on AWS Trainium29 Oct 2025
- 2025XSpecMesh: Quality-Preserving Auto-Regressive Mesh Generation Acceleration via Multi-Head Speculative Decoding31 Jul 2025
- 2025FlowSpec: Continuous Pipelined Speculative Decoding for Efficient Distributed LLM Inference3 Jul 2025
- 2025Gumiho: A Hybrid Architecture to Prioritize Early Tokens in Speculative Decoding13 Mar 2025
- 2024Dynamic-Width Speculative Beam Decoding for Efficient LLM Inference25 Sep 2024
- 2024Cross-layer Attention Sharing for Pre-trained Large Language Models4 Aug 2024
- 2024Optimized Multi-Token Joint Decoding with Auxiliary Model for LLM Inference12 Jul 2024
- 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun 2024
- 2024Accelerating ViT Inference on FPGA through Static and Dynamic Pruning21 Mar 2024
- 2024Minions: Accelerating Large Language Model Inference with Aggregated Speculative Execution24 Feb 2024
12 newest of 19 All 19 (JSON)
- 2022EfficientVLM: Fast and Accurate Vision-Language Models via Knowledge Distillation and Modal-adaptive Pruningcited by 56
- 2024MoPE-CLIP: Structured Pruning for Efficient Vision-Language Models with Module-wise Pruning Error Metriccited by 30
- 2024MULTIFLOW: Shifting Towards Task-Agnostic Vision-Language Pruningcited by 13
- 2025FlashVLM: Text-Guided Visual Token Selection for Large Multimodal Modelscited by 11
- 2023SmartTrim: Adaptive Tokens and Attention Pruning for Efficient Vision-Language Modelscited by 7
- 2025EfficientLLaVA:Generalizable Auto-Pruning for Large Vision-language Modelscited by 7
- 2025Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLMcited by 3
- 2026Structural Pruning of Large Vision Language Models: A Comprehensive Study on Pruning Dynamics, Recovery, and Data Efficiencycited by 2
- 2025Investigating Structural Pruning and Recovery Techniques for Compressing Multimodal Large Language Models: An Empirical Studycited by 1
- 2022Compressing And Debiasing Vision-Language Pre-Trained Models for Visual Question Answeringcited by 0
- 2026Structural Pruning of Large Vision Language Models: A Comprehensive Study on Pruning Dynamics, Recovery, and Data Efficiency27 Apr 2026
- 2025FlashVLM: Text-Guided Visual Token Selection for Large Multimodal Models23 Dec 2025
- 2025Activation-Informed Pareto-Guided Low-Rank Compression for Efficient LLM/VLM7 Oct 2025
- 2025Investigating Structural Pruning and Recovery Techniques for Compressing Multimodal Large Language Models: An Empirical Study28 Jul 2025
- 2025EfficientLLaVA:Generalizable Auto-Pruning for Large Vision-language Models19 Mar 2025
- 2024MULTIFLOW: Shifting Towards Task-Agnostic Vision-Language Pruning8 Apr 2024
- 2024MoPE-CLIP: Structured Pruning for Efficient Vision-Language Models with Module-wise Pruning Error Metric12 Mar 2024
- 2023SmartTrim: Adaptive Tokens and Attention Pruning for Efficient Vision-Language Models24 May 2023
- 2022Compressing And Debiasing Vision-Language Pre-Trained Models for Visual Question Answering26 Oct 2022
- 2022EfficientVLM: Fast and Accurate Vision-Language Models via Knowledge Distillation and Modal-adaptive Pruning14 Oct 2022
- 2023Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policycited by 104
- 2025DiEP: Adaptive Mixture-of-Experts Compression through Differentiable Expert Pruningcited by 24
- 2024A Provably Effective Method for Pruning Experts in Fine-tuned Sparse Mixture-of-Expertscited by 21
- 2024Condense, Don't Just Prune: Enhancing Efficiency and Performance in MoE Layer Pruningcited by 10
- 2025Exploiting the Experts: Unauthorized Compression in MoE-LLMscited by 1
- 2026HodgeCover: Higher-Order Topological Coverage Drives Compression of Sparse Mixture-of-Expertscited by 1
- 2026DynamicGate MLP Conditional Computation via Learned Structural Dropout and Input Dependent Gating for Functional Plasticitycited by 0
- 2026Route-Induced Density and Stability (RIDE): Controlled Intervention and Mechanism Analysis of Routing-Style Meta Prompts on LLM Internal Statescited by 0
- 2026Mixture of Channel Experts: Static Sparse Supports with Input-Adaptive Mixing for Pointwise Projectionscited by 0
- 2026Mixture of Channel Experts: Static Sparse Supports with Input-Adaptive Mixing for Pointwise Projections24 Aug 2026
- 2026HodgeCover: Higher-Order Topological Coverage Drives Compression of Sparse Mixture-of-Experts13 May 2026
- 2026Route-Induced Density and Stability (RIDE): Controlled Intervention and Mechanism Analysis of Routing-Style Meta Prompts on LLM Internal States31 Mar 2026
- 2026DynamicGate MLP Conditional Computation via Learned Structural Dropout and Input Dependent Gating for Functional Plasticity17 Mar 2026
- 2025Exploiting the Experts: Unauthorized Compression in MoE-LLMs22 Nov 2025
- 2025DiEP: Adaptive Mixture-of-Experts Compression through Differentiable Expert Pruning19 Sep 2025
- 2024Condense, Don't Just Prune: Enhancing Efficiency and Performance in MoE Layer Pruning26 Nov 2024
- 2024A Provably Effective Method for Pruning Experts in Fine-tuned Sparse Mixture-of-Experts26 May 2024
- 2023Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy2 Oct 2023
- 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertaintycited by 564
- 2025Keeping Yourself is Important in Downstream Tuning Multimodal Large Language Modelcited by 15
- 2025LIFT the Veil for the Truth: Principal Weights Emerge after Rank Reduction for Reasoning-Focused Supervised Fine-Tuningcited by 11
- 2023Just CHOP: Embarrassingly Simple LLM Compressioncited by 4
- 2026OBC-Prune: Outcome-Based Calibration for Large Reasoning Model Pruningcited by 0
- 2026OBC-Prune: Outcome-Based Calibration for Large Reasoning Model Pruning15 Sep 2026
- 2025LIFT the Veil for the Truth: Principal Weights Emerge after Rank Reduction for Reasoning-Focused Supervised Fine-Tuning1 Jun 2025
- 2025Keeping Yourself is Important in Downstream Tuning Multimodal Large Language Model6 Mar 2025
- 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan 2024
- 2023Just CHOP: Embarrassingly Simple LLM Compression24 May 2023
- 2023Structural Pruning for Diffusion Modelscited by 193
- 2024DiP-GO: A Diffusion Pruner via Few-step Gradient Optimizationcited by 43
- 2023F3-Pruning: A Training-Free and Generalized Pruning Strategy towards Faster and Finer Text-to-Video Synthesiscited by 9
- 2024TriLoRA: Integrating SVD for Advanced Style Personalization in Text-to-Image Generationcited by 5
- 2024DiP-GO: A Diffusion Pruner via Few-step Gradient Optimization22 Oct 2024
- 2024TriLoRA: Integrating SVD for Advanced Style Personalization in Text-to-Image Generation18 May 2024
- 2023F3-Pruning: A Training-Free and Generalized Pruning Strategy towards Faster and Finer Text-to-Video Synthesis6 Dec 2023
- 2023Structural Pruning for Diffusion Models18 May 2023
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2021Scaling Language Models: Methods, Analysis & Insights from Training Gophercited by 1,199
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 700
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 408
- 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 337
- 2023SqueezeLLM: Dense-and-Sparse Quantizationcited by 285
- 2021I-BERT: Integer-only BERT Quantizationcited by 250
- 2021SPoT: Better Frozen Model Adaptation through Soft Prompt Transfercited by 235
- 2023Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessmentcited by 227
- 2023DepGraph: Towards Any Structural Pruningcited by 202
12 most cited of 344 All 344 (JSON)
- 2026Are We Recovering Mechanisms? Objective-Level Recovery Gaps in Mechanistic Interpretability1 Oct 2026
- 2026Learning Functional Subspaces for Neural Network Compression30 Sep 2026
- 2026Output-aware Residual Stream Pruning for Large Language Models28 Sep 2026
- 2026GroupMask: Layer-Adaptive Group-wise Sparsity for Semi-Structured LLM Pruning27 Sep 2026
- 2026Unified Response Geometry for Structured Pruning16 Sep 2026
- 2026Training Trajectories Determine Circuit Removability in Annealable Soft-Prior Transformers9 Sep 2026
- 2026Dense Structural Compression of Transformers via Gauge-Correct Channel Removal7 Sep 2026
- 2026PruneShift: A Framework for Evaluating Decision Reliability in Structured Pruning30 Aug 2026
- 2026Cut-ViT: Task-Specific Model Pruning via Gram Anchoring Subspace Consistency28 Aug 2026
- 2026COEC: Calibrated Orthogonal-Equivalence Compensation for Structured Pruning of Large Language Models21 Aug 2026
- 2026Can Neural Networks Learn by Experimenting on Themselves? Self-Interventional Learning from Functional Consequences to Predictive Self-Knowledge14 Aug 2026
- 2026Fast LapSum: Exact Differentiable Top-k at Million Scale7 Aug 2026
12 newest of 344 All 344 (JSON)