Pith. sign in

REVIEW 1 cited by

Fast and Effective Weight Update for Pruned 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

arxiv 2401.02938 v2 pith:BA6TJRI3 submitted 2024-01-01 cs.CL cs.LG

classification cs.CLcs.LG
keywords pruningweightllmseffectivefastfine-tuninglanguagelarge
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Pruning large language models (LLMs) is a challenging task due to their enormous size. The primary difficulty is fine-tuning the model after pruning, which is needed to recover the lost performance caused by dropping weights. Recent approaches have either ignored fine-tuning entirely, focusing on efficient pruning criteria, or attempted layer-wise weight updates, preserving the behavior of each layer. However, even layer-wise weight updates can be costly for LLMs, and previous works have resorted to various approximations. In our paper, we propose a fast and effective weight update algorithm for pruned layers based on the Alternating Direction Method of Multipliers (ADMM). We further extend it with a simple gradual pruning mask selection and achieve state-of-the-art pruning performance across a wide range of LLMs. Code is available at https://github.com/fmfi-compbio/admm-pruning.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. ProxSparse: Regularized Learning of Semi-Structured Sparsity Masks for Pretrained LLMs

    cs.LG 2025-02 conditional novelty 6.0 of 10

    ProxSparse learns 2:4 semi-structured sparsity masks for pretrained LLMs via regularized proximal-gradient optimization, outperforming heuristic baselines on seven models.

Pith tools