Pith. sign in

REVIEW 1 cited by

ALPS: Improved Optimization for Highly Sparse One-Shot 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

arxiv 2406.07831 v3 pith:H2CZ636M submitted 2024-06-12 cs.LG

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

The impressive performance of Large Language Models (LLMs) across various natural language processing tasks comes at the cost of vast computational resources and storage requirements. One-shot pruning techniques offer a way to alleviate these burdens by removing redundant weights without the need for retraining. Yet, the massive scale of LLMs often forces current pruning approaches to rely on heuristics instead of optimization-based techniques, potentially resulting in suboptimal compression. In this paper, we introduce ALPS, an optimization-based framework that tackles the pruning problem using the operator splitting technique and a preconditioned conjugate gradient-based post-processing step. Our approach incorporates novel techniques to accelerate and theoretically guarantee convergence while leveraging vectorization and GPU parallelism for efficiency. ALPS substantially outperforms state-of-the-art methods in terms of the pruning objective and perplexity reduction, particularly for highly sparse models. On the OPT-30B model with 70% sparsity, ALPS achieves a 13% reduction in test perplexity on the WikiText dataset and a 19% improvement in zero-shot benchmark performance compared to existing methods.

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. TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks

    cs.LG 2025-05 conditional novelty 6.0 of 10

    TSENOR computes transposable N:M masks up to hundreds of times faster than prior solvers by combining entropy-regularized optimal transport with a greedy plus local search rounding.

Pith tools