mlsanityData to 7 Oct 2026

ExCP: Extreme LLM Checkpoint Compression via Weight-Momentum Joint Shrinking

arXiv 2406.11257 ↗First posted 17 Jun 2024cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Large language models (LLM) have recently attracted significant attention in the field of artificial intelligence. However, the training process of these models poses significant challenges in terms of computational and storage capacities, thus compressing checkpoints has become an urgent problem. In this paper, we propose a novel Extreme Checkpoint Compression (ExCP) framework, which significantly reduces the required storage of training checkpoints while achieving nearly lossless performance. We first calculate the residuals of adjacent checkpoints to obtain the essential but sparse information for higher compression ratio. To further excavate the redundancy parameters in checkpoints, we then propose a weight-momentum joint shrinking method to utilize another important information during the model optimization, i.e., momentum. In particular, we exploit the information of both model and optimizer to discard as many parameters as possible while preserving critical information to ensure optimal performance. Furthermore, we utilize non-uniform quantization to further compress the storage of checkpoints. We extensively evaluate our proposed ExCP framework on several models ranging from 410M to 7B parameters and demonstrate significant storage reduction while maintaining strong performance. For instance, we achieve approximately 70× compression for the Pythia-410M model, with the final performance being as accurate as the original model on various downstream tasks. Codes will be available at https://github.com/Gaffey/ExCP.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 21 of its 30 references that are in the map. First posted on arXiv 17 Jun 2024.

Builds on

21 of 30 references.

References · 21

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  4. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
  5. 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,346
  6. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  7. 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,734
  8. 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
  9. 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
  10. 2019On the Convergence of Adam and Beyondcited by 834
  11. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
  12. 2019Learned Step Size Quantizationcited by 604
9 more
  1. 2020A Simple Convergence Proof of Adam and Adagradcited by 169
  2. 2022Adam Can Converge Without Any Modification On Update Rulescited by 112
  3. 2020SCOP: Scientific Control for Reliable Neural Network Pruningcited by 92
  4. 2023PPT: Token Pruning and Pooling for Efficient Vision Transformerscited by 37
  5. 2023TinySAM: Pushing the Envelope for Efficient Segment Anything Modelcited by 33
  6. 2023PanGu-π: Enhancing Language Model Architectures via Nonlinearity Compensationcited by 17
  7. 2020MTP: Multi-Task Pruning for Efficient Semantic Segmentation Networkscited by 7
  8. 2020On Efficient Constructions of Checkpointscited by 6
  9. 2023Inshrinkerator: Compressing Deep Learning Training Checkpoints via Dynamic Quantizationcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 2.

5 papers.