pith. sign in

Rethinking Layer Redundancy in Large Language Models: Calibration Objectives and Search for Depth Pruning

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Depth pruning improves the inference efficiency of large language models by removing Transformer blocks. Prior work has largely treated layer redundancy as an inherent structural property of pretrained networks, emphasizing importance criteria and search algorithms for identifying removable layers. In contrast, we adopt a \emph{functional perspective}, where redundancy depends jointly on the model and the calibration objective, suggesting that a universal layer ranking may not exist. Through an empirical study across three LLM families, two calibration objectives, and seven search algorithms, we find that different objectives produce qualitatively different pruning patterns, while perplexity and downstream reasoning accuracy rankings often fail to align. In contrast, under a fixed objective, different search algorithms tend to converge to similar pruning solutions. Overall, our results suggest that the calibration objective may play a larger role than the particular search algorithm in determining which layers appear redundant.

fields

cs.LG 1

years

2026 1

verdicts

UNVERDICTED 1

clear filters

representative citing papers

Locality-Aware Redundancy Pruning for LLM Depth Compression

cs.LG · 2026-05-27 · unverdicted · novelty 6.0

LoRP uses a new Representation Locality Score derived from inter-layer hidden-state similarity to cluster layers and prune intra-cluster redundancies in one shot, yielding better perplexity and task accuracy than prior depth-pruning baselines across LLM families.

citing papers explorer

Showing 1 of 1 citing paper after filters.

  • Locality-Aware Redundancy Pruning for LLM Depth Compression cs.LG · 2026-05-27 · unverdicted · none · ref 13 · internal anchor

    LoRP uses a new Representation Locality Score derived from inter-layer hidden-state similarity to cluster layers and prune intra-cluster redundancies in one shot, yielding better perplexity and task accuracy than prior depth-pruning baselines across LLM families.