aiqbench analysis
This paper introduces AMP, a structured pruning technique that optimizes Large Language Models by selectively removing less critical components within Multi-Head Attention and MLP layers. By projecting input data onto weights to assess structural importance, the method achieves significant compression ratios while maintaining performance on commonsense reasoning tasks across various model families like LLaMA and Phi. The approach offers a practical pathway for deploying efficient AI models in resource-constrained environments without sacrificing zero-shot capabilities.
Efficient LLMs with AMP: Attention Heads and MLP Pruning
arXiv:2504.21174v2 Announce Type: replace Abstract: Deep learning drives a new wave in computing systems and triggers the automation of increasingly complex problems. In particular, Large Language Models (LLMs) have significantly advanced cognitive tasks, often matching or even surpassing human-level performance. However, their extensive parameters result in high computational costs and slow inference, posing challenges for deployment in resource-limited settings. Among the strategies to overcome the aforementioned challenges, pruning emerges as a successful mechanism since it reduces model size while maintaining predictive ability. In this paper, we introduce AMP: Attention Heads and MLP Pruning, a novel structured pruning method that efficiently compresses LLMs by removing less critical structures within Multi-Head Attention (MHA) and Multilayer Perceptron (MLP). By projecting the input data onto weights, AMP assesses structural importance and overcomes the limitations of existing techniques, which often fall short in flexibility or efficiency. In particular, AMP surpasses the current state-of-the-art on commonsense reasoning tasks by up to 1.49 percentage points, achieving a 30% pruning ratio with minimal impact on zero-shot task performance. Moreover, AMP also improves inference speeds, making it well-suited for deployment in resource-constrained environments. We confirm the flexibility of AMP on different families of LLMs, including LLaMA and Phi.
Abstract:Deep learning drives a new wave in computing systems and triggers the automation of increasingly complex problems. In particular, Large Language Models (LLMs) have significantly advanced cognitive tasks, often matching or even surpassing human-level performance. However, their extensive parameters result in high computational costs and slow inference, posing challenges for deployment in resource-limited settings. Among the strategies to overcome the aforementioned challenges, pruning emerges as a successful mechanism since it reduces model size while maintaining predictive ability. In this paper, we introduce AMP: Attention Heads and MLP Pruning, a novel structured pruning method that efficiently compresses LLMs by removing less critical structures within Multi-Head Attention (MHA) and Multilayer Perceptron (MLP). By projecting the input data onto weights, AMP assesses structural importance and overcomes the limitations of existing techniques, which often fall short in flexibility or efficiency. In particular, AMP surpasses the current state-of-the-art on commonsense reasoning tasks by up to 1.49 percentage points, achieving a 30% pruning ratio with minimal impact on zero-shot task performance. Moreover, AMP also improves inference speeds, making it well-suited for deployment in resource-constrained environments. We confirm the flexibility of AMP on different families of LLMs, including LLaMA and Phi.
Machine Learning (cs.LG)
arXiv:2504.21174 [cs.LG]
(or arXiv:2504.21174v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2504.21174 Focus to learn more arXiv-issued DOI via DataCite
https://doi.org/10.1109/IJCNN64981.2025.11227985 Focus to learn more DOI(s) linking to related resources
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 296 words
Related coverage
Multi-Objective Structured Pruning of LLMs for Latency and Model Size Optimization
arXiv · Jul 29, 2026

PagedAttention vs. RadixAttention: Optimizing LLM KV Cache Management
Analytics Vidhya · Aug 21, 2026
HHR: Hierarchical Hash Retrieval for Efficient LLM Generation
arXiv · Oct 2, 2026
Distance-KV: Exploiting Relative Distance for Efficient Long-Context Inference
arXiv · Sep 30, 2026