D2Prune: Sparsifying Large Language Models via Dual Taylor Expansion and Attention Distribution Awareness
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) face significant deployment challenges due to their massive computational demands. % While pruning offers a promising compression solution, existing methods suffer from two critical limitations: (1) They neglect activation distribution shifts between calibration data and test data, resulting in inaccurate error estimations; (2) They overlook the long-tail distribution characteristics of activations in the attention module. To address these limitations, this paper proposes a novel pruning method, D2Prune. First, we propose a dual Taylor expansion-based method that jointly models weight and activation perturbations for precise error estimation, leading to precise pruning mask selection and weight updating and facilitating error minimization during pruning. % Second, we propose an attention-aware dynamic update strategy that preserves the long-tail attention pattern by jointly minimizing the KL divergence of attention distributions and the reconstruction error. Extensive experiments show that D2Prune consistently outperforms SOTA methods across various LLMs (e.g., OPT-125M, LLaMA2/3, and Qwen3). Moreover, the dynamic attention update mechanism also generalizes well to ViT-based vision models like DeiT, achieving superior accuracy on ImageNet-1K.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 24 of its 36 references that are in the map. First posted on arXiv 14 Jan 2026.
Builds on
24 of 36 references.
References · 24
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2020Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecastingcited by 2,141
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
12 more
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2018Rethinking the Value of Network Pruningcited by 595
- 2020What is the State of Neural Network Pruning?cited by 578
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
- 2023OmniQuant: Omnidirectionally Calibrated Quantization for Large Language Modelscited by 403
- 2022A Fast Post-Training Pruning Framework for Transformerscited by 161
- 2022Pretrained Language Models for Text Generation: A Surveycited by 121
- 2025Unveiling Causal Reasoning in Large Language Models: Reality or Mirage?cited by 36
- 2022Rare Gems: Finding Lottery Tickets at Initializationcited by 34
- 2021Pruning Randomly Initialized Neural Networks with Iterative Randomizationcited by 20
- 2021On the Distribution, Sparsity, and Inference-time Quantization of Attention Values in Transformerscited by 14
- 2021RelTransformer: A Transformer-Based Long-Tail Visual Relationship Recognitioncited by 9
Built on by
Citing papers per year: 2026: 2.
2 papers.