Pith. sign in

REVIEW 1 cited by

Lillama: Large Language Models Compression via Low-Rank Feature Distillation

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 2412.16719 v2 pith:R5VJ4QCK submitted 2024-12-21 cs.LG cs.AI

classification cs.LGcs.AI
keywords activationscompressionlillamalow-rankperformancecalibrationmethodmodel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Current LLM structured pruning methods typically involve two steps: (1) compression with calibration data and (2) costly continued pretraining on billions of tokens to recover lost performance. This second step is necessary as the first significantly impacts model accuracy. Prior research suggests pretrained Transformer weights aren't inherently low-rank, unlike their activations, which may explain this drop. Based on this observation, we propose Lillama, a compression method that locally distills activations with low-rank weights. Using SVD for initialization and a joint loss combining teacher and student activations, we accelerate convergence and reduce memory use with local gradient updates. Lillama compresses Mixtral-8x7B within minutes on a single A100 GPU, removing 10 billion parameters while retaining over 95% of its original performance. Phi-2 3B can be compressed by 40% with just 13 million calibration tokens, resulting in a small model that competes with recent models of similar size. The method generalizes well to non-transformer architectures, compressing Mamba-3B by 20% while maintaining 99% performance.

Discussion (0). Sign in 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. CALR: Corrective Adaptive Low-Rank Decomposition for Efficient Large Language Model Layer Compression

    cs.LG 2025-08 unverdicted novelty 4.0 of 10

    CALR adds a parallel learnable low-rank module to recover functional performance lost by SVD-based compression of LLM weight matrices.

Pith tools