Pith. sign in

REVIEW 2 cited by

Efficient LLMs with AMP: Attention Heads and MLP Pruning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.21174 v2 pith:VAP6Z7XD submitted 2025-04-29 cs.LG

Efficient LLMs with AMP: Attention Heads and MLP Pruning

classification cs.LG
keywords pruningllmsattentionchallengesdeploymentflexibilityheadsinference
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Fragile Knowledge, Robust Instruction-Following: The Width Pruning Dichotomy in Llama-3.2

    cs.CL 2025-12 unverdicted novelty 7.0

    Width pruning in Llama-3.2 models reduces parametric knowledge while enhancing instruction-following and preserving reasoning.

  2. Multi-Objective Structured Pruning of LLMs for Latency and Model Size Optimization

    cs.AI 2026-06 conditional novelty 4.0

    A two-stage depth-plus-width pruning pipeline (NSGA-II + parallel Bayesian optimization) reports top average accuracy and lowest latency across four LLMs at 37.5-50% sparsity, with material internal inconsistencies in...