Forward-Free LLM Depth Pruning via Weight Redundancy

Vincent-Daniel Yun, Woosang Lim
9/9/2026
cs.LGcs.AIcs.PF

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{yun2026forwardfree,
  title  = {Forward-Free LLM Depth Pruning via Weight Redundancy},
  author = {Vincent-Daniel Yun and Woosang Lim},
  year   = {2026},
  eprint = {2609.09883},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2609.09883v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2609.09883.svg)](https://codeofpaper.com/paper/2609.09883)

Discussion