Dependency-Aware Semi-Structured Sparsity of GLU Variants in Large Language Models
Not on the map. Why?
Abstract (arXiv)
The rapid advancement in Large Language Models (LLMs) has markedly enhanced the capabilities of language understanding and generation. However, the substantial model size poses hardware challenges, affecting both memory size for serving and inference latency for token generation. To address those challenges, we propose Dependency-aware Semi-structured Sparsity (DaSS), a novel method for the recent prevalent GLU-based LLMs pruning, which incorporates structural dependency into the weight magnitude-based unstructured pruning. We introduce an MLP-specific pruning metric that evaluates the importance of each weight by jointly considering its magnitude and its corresponding MLP intermediate activation norms. DaSS facilitates a balance between the adaptability offered by unstructured pruning and the structural consistency inherent in dependency-based structured pruning. Empirical evaluations on LLaMA2, Mistral, and Gemma model families demonstrate that DaSS not only outperforms both SparseGPT and Wanda in achieving hardware-friendly N:M sparsity patterns but also maintains the computational efficiency of Wanda.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 47 of its 59 references that are in the map. First posted on arXiv 3 May 2024.
Builds on
47 of 59 references.
References · 47
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 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
- 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
- 2016Gaussian Error Linear Units (GELUs)cited by 3,431
- 2023Mistral 7Bcited by 3,065
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
35 more
- 2022Locating and Editing Factual Associations in GPTcited by 2,609
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2020GLU Variants Improve Transformercited by 1,724
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,311
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2024Gemma: Open Models Based on Gemini Research and Technologycited by 889
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 700
- 2016Language Modeling with Gated Convolutional Networkscited by 688
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
- 2023Dissecting Recall of Factual Associations in Auto-Regressive Language Modelscited by 512
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 408
- 2023SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compressioncited by 359
- 2022The case for 4-bit precision: k-bit Inference Scaling Lawscited by 247
- 2023Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Timecited by 247
- 2024Extreme Compression of Large Language Models via Additive Quantizationcited by 223
- 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 219
- 2021Accelerating Sparse Deep Neural Networkscited by 213
- 2023DepGraph: Towards Any Structural Pruningcited by 202
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
- 2017Searching for Activation Functionscited by 158
- 2021MoEfication: Transformer Feed-forward Layers are Mixtures of Expertscited by 149
- 2022The Lazy Neuron Phenomenon: On Emergence of Activation Sparsity in Transformerscited by 121
- 2023Chain-of-Thought Hub: A Continuous Effort to Measure Large Language Models' Reasoning Performancecited by 102
- 2023ReLU Strikes Back: Exploiting Activation Sparsity in Large Language Modelscited by 91
- 2022Understanding Transformer Memorization Recall Through Idiomscited by 62
- 2023Compressing LLMs: The Truth is Rarely Pure and Never Simplecited by 59
- 2023QUIK: Towards End-to-End 4-Bit Inference on Generative Large Language Modelscited by 39
- 2023Investigating Hallucinations in Pruned Large Language Models for Abstractive Summarizationcited by 16
- 2024Fast and Effective Weight Update for Pruned Large Language Modelscited by 11
Built on by
Citing papers per year: 2025: 2.
2 papers.