DReSS: Data-driven Regularized Structured Streamlining for Large Language Models
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) have achieved significant progress across various domains, but their increasing scale results in high computational and memory costs. Recent studies have revealed that LLMs exhibit sparsity, providing the potential to reduce model size through pruning techniques. However, existing pruning methods typically follow a prune-then-finetune paradigm. Since the pruned components still contain valuable information, their direct removal often leads to irreversible performance degradation, imposing a substantial computational burden to recover performance during finetuning. In this paper, we propose a novel paradigm that first applies regularization, then prunes, and finally finetunes. Based on this paradigm, we introduce DReSS, a simple and effective Data-driven Regularized Structured Streamlining method for LLMs. By leveraging a small amount of data to regularize the components to be pruned, DReSS explicitly transfers the important information to the remaining parts of the model in advance. Compared to direct pruning, this can reduce the information loss caused by parameter removal, thereby enhancing its language modeling capabilities. Experimental results demonstrate that DReSS significantly outperforms existing pruning methods even under extreme pruning ratios, significantly reducing latency and increasing throughput.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 42 of its 58 references that are in the map. First posted on arXiv 29 Jan 2025.
Builds on
42 of 58 references.
References · 42
- 2017Attention Is All You Needcited by 60,361
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2023GPT-4 Technical Reportcited by 18,396
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2021Convex optimizationcited by 2,515
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,218
30 more
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,386
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2023Distilling Step-by-Step! Outperforming Larger Language Models with Less Training Data and Smaller Model Sizescited by 737
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 541
- 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 526
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
- 2023A Survey on Model Compression for Large Language Modelscited by 269
- 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 179
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 165
- 2022Distilling Reasoning Capabilities into Smaller Language Modelscited by 158
- 2024LaCo: Large Language Model Pruning via Layer Collapsecited by 126
- 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
- 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 111
- 2024SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blockscited by 97
- 2022The Effects of Regularization and Data Augmentation are Class Dependentcited by 67
- 2022Avoiding Overfitting: A Survey on Regularization Methods for Convolutional Neural Networkscited by 55
- 2024Beyond Examples: High-level Automated Reasoning Paradigm in In-Context Learning via MCTScited by 54
- 2024BESA: Pruning Large Language Models with Blockwise Parameter-Efficient Sparsity Allocationcited by 45
- 2024Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Modelscited by 40
- 2020SparseRT: Accelerating Unstructured Sparsity on GPUs for Deep Learning Inferencecited by 30
- 2023Matrix Compression via Randomized Low Rank and Low Precision Factorizationcited by 25
- 2024DISP-LLM: Dimension-Independent Structural Pruning for Large Language Modelscited by 24
- 2024Faster and Lighter LLMs: A Survey on Current Challenges and Way Forwardcited by 21
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.
- 2025Two-Stage Regularization-Based Structured Pruning for LLMscited by 3
- 2026Late-Layer Fusion is Enough: Dual-Path Vision Token Routing for Multimodal Large Language Models under Visual Saturationcited by 0
- 2026Decoupled Visual Processing: Efficient Multimodal Adaptation via Modality-Specific Transformer Substitutioncited by 0
- 2026Decoupled Visual Processing: Efficient Multimodal Adaptation via Modality-Specific Transformer Substitution29 Jul 2026
- 2026Late-Layer Fusion is Enough: Dual-Path Vision Token Routing for Multimodal Large Language Models under Visual Saturation8 Jun 2026
- 2025Two-Stage Regularization-Based Structured Pruning for LLMs23 May 2025