DenoiseRotator: Enhance Pruning Robustness for LLMs via Importance Concentration
Not on the map. Why?
Abstract (arXiv)
Pruning is a widely used technique to compress large language models (LLMs) by removing unimportant weights, but it often suffers from significant performance degradation - especially under semi-structured sparsity constraints. Existing pruning methods primarily focus on estimating the importance of individual weights, which limits their ability to preserve critical capabilities of the model. In this work, we propose a new perspective: rather than merely selecting which weights to prune, we first redistribute parameter importance to make the model inherently more amenable to pruning. By minimizing the information entropy of normalized importance scores, our approach concentrates importance onto a smaller subset of weights, thereby enhancing pruning robustness. We instantiate this idea through DenoiseRotator, which applies learnable orthogonal transformations to the model's weight matrices. Our method can be seamlessly integrated with existing pruning techniques such as Magnitude, SparseGPT, and Wanda. Evaluated on LLaMA3, Qwen2.5, and Mistral models under 50% unstructured and 2:4 semi-structured sparsity, DenoiseRotator consistently improves perplexity and zero-shot accuracy. For instance, on LLaMA3-70B pruned with SparseGPT at 2:4 semi-structured sparsity, DenoiseRotator reduces the perplexity gap to the dense model by 58%, narrowing the degradation from 8.1 to 3.4 points. Codes are available at https://github.com/Axel-gu/DenoiseRotator.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 27 of its 43 references that are in the map. First posted on arXiv 29 May 2025.
Builds on
27 of 43 references.
References · 27
- 2017Attention Is All You Needcited by 59,932
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2024Qwen2.5 Technical Reportcited by 4,713
- 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
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 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
15 more
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2024QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMscited by 598
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
- 2024SpinQuant: LLM quantization with learned rotationscited by 446
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
- 2024QuIP#: Even Better LLM Quantization with Hadamard Incoherence and Lattice Codebookscited by 354
- 2018Riemannian Adaptive Optimization Methodscited by 187
- 2020Geoopt: Riemannian Optimization in PyTorchcited by 109
- 2025OstQuant: Refining Large Language Model Quantization with Orthogonal and Scaling Transformations for Better Distribution Fittingcited by 94
- 2024QTIP: Quantization with Trellises and Incoherence Processingcited by 86
- 2020Efficient Riemannian Optimization on the Stiefel Manifold via the Cayley Transformcited by 79
- 2024VPTQ: Extreme Low-bit Vector Post-Training Quantization for Large Language Modelscited by 53
- 2024MaskLLM: Learnable Semi-Structured Sparsity for Large Language Modelscited by 49
- 2024Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Modelscited by 40
- 2023One-Shot Sensitivity-Aware Mixed Sparsity Pruning for Large Language Modelscited by 16
Built on by
Citing papers per year: 2025: 3; 2026: 3.
6 papers.
- 2025ARMOR: High-Performance Semi-Structured Pruning via Adaptive Matrix Factorizationcited by 2
- 2025RCPU: Rotation-Constrained Error Compensation for Structured Pruning of Large Language Modelscited by 2
- 2026High-Fidelity Pruning for Large Language Modelscited by 1
- 2025Change-of-Basis Pruning via Rotational Invariancecited by 0
- 2026Efficient Post-Training Pruning of Large Language Models with Statistical Correctioncited by 0
- 2026COEC: Calibrated Orthogonal-Equivalence Compensation for Structured Pruning of Large Language Modelscited by 0
- 2026COEC: Calibrated Orthogonal-Equivalence Compensation for Structured Pruning of Large Language Models21 Aug 2026
- 2026High-Fidelity Pruning for Large Language Models9 Mar 2026
- 2026Efficient Post-Training Pruning of Large Language Models with Statistical Correction7 Feb 2026
- 2025Change-of-Basis Pruning via Rotational Invariance20 Nov 2025
- 2025RCPU: Rotation-Constrained Error Compensation for Structured Pruning of Large Language Models9 Oct 2025
- 2025ARMOR: High-Performance Semi-Structured Pruning via Adaptive Matrix Factorization7 Oct 2025