REVIEW 3 cited by
SlimGPT: Layer-wise Structured Pruning for Large Language Models
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
read the original abstract
Large language models (LLMs) have garnered significant attention for their remarkable capabilities across various domains, whose vast parameter scales present challenges for practical deployment. Structured pruning is an effective method to balance model performance with efficiency, but performance restoration under computational resource constraints is a principal challenge in pruning LLMs. Therefore, we present a low-cost and fast structured pruning method for LLMs named SlimGPT based on the Optimal Brain Surgeon framework. We propose Batched Greedy Pruning for rapid and near-optimal pruning, which enhances the accuracy of head-wise pruning error estimation through grouped Cholesky decomposition and improves the pruning efficiency of FFN via Dynamic Group Size, thereby achieving approximate local optimal pruning results within one hour. Besides, we explore the limitations of layer-wise pruning from the perspective of error accumulation and propose Incremental Pruning Ratio, a non-uniform pruning strategy to reduce performance degradation. Experimental results on the LLaMA benchmark show that SlimGPT outperforms other methods and achieves state-of-the-art results.
Forward citations
Cited by 3 Pith papers
-
SlimLLM: Accurate Structured Pruning for Large Language Models
SlimLLM prunes LLMs by scoring whole attention heads and feed-forward channels with Pearson similarity and PCA-based measures, then restores accuracy with per-dimension linear regression and non-uniform layer ratios.
-
Pangu Light: Weight Re-Initialization for Pruning and Accelerating LLMs
Pangu Light prunes LLMs across width, depth, and attention heads, then re-initializes remaining weights, achieving up to 4.2x throughput with modest benchmark loss.
-
Get Experience from Practice: LLM Agents with Record & Replay
AgentRR is a proposed paradigm that records agent traces, generalizes them into multi-level experiences, and replays them under safety checks to make LLM agents cheaper, faster, and more reliable.
Discussion (0). Continue with ORCID to comment.