CLFeb 16

GradMAP: Faster Layer Pruning with Gradient Metric and Projection Compensation

arXiv:2602.14649v1h-index: 6
Originality Incremental advance
AI Analysis

This work addresses the practical deployment limitations of LLMs by improving pruning efficiency and performance, though it is incremental as it builds on existing layer pruning research.

The paper tackles the problem of high computational costs in Large Language Models (LLMs) by proposing GradMAP, a faster layer pruning method that uses gradient metrics and projection compensation, resulting in an average 4x speedup in pruning while outperforming previous methods in performance.

Large Language Models (LLMs) exhibit strong reasoning abilities, but their high computational costs limit their practical deployment. Recent studies reveal significant redundancy in LLMs layers, making layer pruning an active research topic. Layer pruning research primarily focuses on two aspects: measuring layer importance and recovering performance after pruning. Unfortunately, the present works fail to simultaneously maintain pruning performance and efficiency. In this study, we propose GradMAP, a faster layer pruning method with \textbf{Grad}ient \textbf{M}etric \textbf{A}nd \textbf{P}rojection compensation, which consists of two stages. In the first stage, we introduce a novel metric based on gradient magnitudes, enabling a global assessment of layer importance. Note that, it requires only a single backward propagation step per pruning decision, substantially enhancing pruning efficiency. In the second stage, we first analyze the layers with the largest mean shift resulting from pruning, and then incorporate a simple yet effective projection compensation matrix to correct this drift in one step. In this way, the degradation of model performance caused by layer pruning is effectively alleviated. Extensive experiments show that GradMAP outperforms previous layer pruning methods in both pruning speed (achieving an average $4\times$ speedup) and performance.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes