Rethinking Compression: Reduced Order Modelling of Latent Features in Large Language Models

Arnav Chavan, Nahush Lele, Deepak Gupta
12/12/2023
cs.LGcs.CL

No official code found. Best implementation: transmuteAI/trailmet (19 stars, MIT, last commit 2023-10-02).

Abstract

Due to the substantial scale of Large Language Models (LLMs), the direct application of conventional compression methodologies proves impractical. The computational demands associated with even minimal gradient updates present challenges, particularly on consumer-grade hardware. This paper introduces an innovative approach for the parametric and practical compression of LLMs based on reduced order modelling, which entails low-rank decomposition within the feature space and re-parameterization in the weight space. Notably, this compression technique operates in a layer-wise manner, obviating the need for a GPU device and enabling the compression of billion-scale models within stringent constraints of both memory and time. Our method represents a significant advancement in model compression by leveraging matrix decomposition, demonstrating superior efficacy compared to the prevailing state-of-the-art structured pruning method.

View on arXivView PDF

Code Implementations(1)

MIT

Transmute AI Lab Model Efficiency Toolkit

1915Python, Jupyter NotebookDec 22, 20213 years agoMIT

Similar Papers

Cite this paper

@article{chavan2023rethinking,
  title  = {Rethinking Compression: Reduced Order Modelling of Latent Features in Large Language Models},
  author = {Arnav Chavan and Nahush Lele and Deepak Gupta},
  year   = {2023},
  eprint = {2312.07046},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2312.07046v1}
}

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/2312.07046.svg)](https://codeofpaper.com/paper/2312.07046)

Discussion