mlsanityData to 14 Oct 2026

ACE: Exploring Activation Cosine Similarity and Variance for Accurate and Calibration-Efficient LLM Pruning

arXiv 2505.21987 ↗First posted 28 May 2025cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

With the rapid expansion of large language models (LLMs), the demand for memory and computational resources has grown significantly. Recent advances in LLM pruning aim to reduce the size and computational cost of these models. However, existing methods often suffer from either suboptimal pruning performance or low time efficiency during the pruning process. In this work, we propose an efficient and effective pruning method that simultaneously achieves high pruning performance and fast pruning speed with improved calibration efficiency. Our approach introduces two key innovations: (1) An activation cosine similarity loss-guided pruning metric, which considers the angular deviation of the output activation between the dense and pruned models. (2) An activation variance-guided pruning metric, which helps preserve semantic distinctions in output activations after pruning, enabling effective pruning with shorter input sequences. These two components can be readily combined to enhance LLM pruning in both accuracy and efficiency. Experimental results show that our method achieves up to an 18% reduction in perplexity and up to 63% decrease in pruning time on prevalent LLMs such as LLaMA, LLaMA-2, and OPT.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 42 of its 52 references that are in the map. First posted on arXiv 28 May 2025.

Builds on

42 of 52 references.

References · 42

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  4. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  5. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  6. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,297
  7. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  8. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  9. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  10. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
  11. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
  12. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
30 more
  1. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
  2. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
  3. 2016Pointer Sentinel Mixture Modelscited by 3,096
  4. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  5. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  6. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  7. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,173
  8. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  9. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  10. 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,386
  11. 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,298
  12. 2016Pruning Filters for Efficient ConvNetscited by 1,143
  13. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  14. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  15. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  16. 2019How Contextual are Contextualized Word Representations? Comparing the Geometry of BERT, ELMo, and GPT-2 Embeddingscited by 784
  17. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
  18. 2018Rethinking the Value of Network Pruningcited by 599
  19. 2020Recipes for building an open-domain chatbotcited by 593
  20. 2019Importance Estimation for Neural Network Pruningcited by 541
  21. 2019The State of Sparsity in Deep Neural Networkscited by 476
  22. 2019HAWQ: Hessian AWare Quantization of Neural Networks with Mixed-Precisioncited by 402
  23. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 328
  24. 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 322
  25. 2021Accelerating Sparse Deep Neural Networkscited by 223
  26. 2022Language model compression with weighted low-rank factorizationcited by 195
  27. 2020BinaryBERT: Pushing the Limit of BERT Quantizationcited by 178
  28. 2024Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Modelscited by 40
  29. 2022SPDY: Accurate Pruning with Speedup Guaranteescited by 36
  30. 2025Wanda++: Pruning Large Language Models via Regional Gradientscited by 26

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.