Pith. sign in

REVIEW 1 cited by

CURing Large Models: Compression via CUR Decomposition

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 2501.04211 v2 pith:MFJIN7U4 submitted 2025-01-08 cs.LG cs.AI

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

Large deep learning models have achieved remarkable success but are resource-intensive, posing challenges such as memory usage. We introduce CURing, a novel model compression method based on CUR matrix decomposition, which approximates weight matrices as the product of selected columns (C) and rows (R), and a small linking matrix (U). We apply this decomposition to weights chosen based on the combined influence of their magnitudes and activations. By identifying and retaining informative rows and columns, CURing significantly reduces model size with minimal performance loss. For example, it reduces Llama3.1-8B's parameters to 7.32B (-9%) in just 129 seconds, over 20 times faster than prior compression 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. Frugal Machine Learning for Energy-efficient, and Resource-aware Artificial Intelligence

    cs.LG 2025-06 conditional novelty 1.0 of 10

    A survey paper that defines and categorizes Frugal Machine Learning methods but introduces no new techniques or empirical results.

Pith tools