paper-with-me

홈 › Papers

Forward-Free LLM Depth Pruning via Weight Redundancy

2026-09-09 · Vincent-Daniel Yun, Woosang Lim arxiv

Depth pruning reduces large language model (LLM) inference cost by removing complete Transformer blocks. Activation-based methods collect hidden states through forward passes on calibration data, while existing forward-free methods score each Transformer block separately without measuring similarity between blocks. We propose Weight-Redundancy Pruning (WRP), a forward-free depth-pruning method that estimates inter-layer redundancy from checkpoint weights to select blocks without calibration data or model forward passes. WRP compares attention output and MLP down-projection weights across layers and combines their pairwise similarities with relative projection-scale information. The resulting all-pairs similarity matrix guides layer grouping and block selection. Across multiple pruning settings, model families, and downstream tasks, WRP consistently outperforms existing forward-free magnitude pruning and approaches the performance of activation-based methods.

📄 PDF Abstract BibTeX arXiv:2609.09883

Code (1)

teddytennant/jax-wrp

Similar Papers 제목 키워드 기반

Locality-Aware Redundancy Pruning for LLM Depth Compression

2026-05-27 · Vincent-Daniel Yun, Youngrae Kim, Woosang Lim, YoungJin Heo 외 arxiv

Large language models are known to contain representational redundancy across network depth, making depth pruning an effective approach for improving inference efficiency. Existing one-shot pruning methods rely on local …

Structural Sensitivity in Compressed Transformers: Relative Error Propagation and Layer Removal

2026-03-22 · Abhinaba Basu, Kumkum Basu, Koushik Deb arxiv

Compressing transformer weights makes large language models cheaper to deploy. But each layer's compression introduces an error. These errors accumulate as the signal passes through later layers, and how they accumulate …

RAPID: Layer-Wise Redundancy-Aware Pruning and Importance-Driven Token Merging for Efficient ViT

2026-06-06 · Kyumin Choi, Ikbeom Jang arxiv

Vision Transformers (ViTs) achieve strong performance but suffer from high computational costs due to quadratic self-attention complexity. Although token reduction techniques such as pruning and merging mitigate this, th…

Depth Adaptive Efficient Visual Autoregressive Modeling

2026-04-19 · Chunliang Li, Tianze Cao, Sanyuan Zhao arxiv

Visual Autoregressive (VAR) modeling inefficiently applies a fixed computational depth to each position when generating high-resolution images. While existing methods accelerate inference by pruning tokens using frequenc…

Straightforward Layer-wise Pruning for More Efficient Visual Adaptation

2024-07-19 · Ruizi Han, Jinglei Tang

Parameter-efficient transfer learning (PETL) aims to adapt large pre-trained models using limited parameters. While most PETL approaches update the added parameters and freeze pre-trained weights during training, the min…

ClusteringTransfer Learning