CURing Large Models: Compression via CUR Decomposition

Sanghyeon Park, Soo-Mook Moon
1/8/2025
cs.LGcs.AI

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{park2025curing,
  title  = {CURing Large Models: Compression via CUR Decomposition},
  author = {Sanghyeon Park and Soo-Mook Moon},
  year   = {2025},
  eprint = {2501.04211},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.04211v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.04211.svg)](https://codeofpaper.com/paper/2501.04211)

Discussion