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.
Rethinking Compression: Reduced Order Modelling of Latent Features in Large Language Models
This paper presents a new compression technique for Large Language Models (LLMs) using reduced order modeling and low-rank decomposition that operates in a layer-wise manner without a GPU, achieving better results than structured pruning.
- Year
- 2023
- Venue
- arXiv 2023
- Authors
- 3
- Hosting
- Abstract onlyARXIV-DEFAULT
Cite
Notes
Only stored in your browser.
Attribution
- Abstract & full text
- arxiv.org/abs/2312.07046ARXIV-DEFAULT
- TL;DR
- Semantic Scholar