mlsanityData to 14 Oct 2026

When Compression Meets Model Compression: Memory-Efficient Double Compression for Large Language Models

arXiv 2502.15443 ↗First posted 21 Feb 2025cs.CL cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

Large language models (LLMs) exhibit excellent performance in various tasks. However, the memory requirements of LLMs present a great challenge when deploying on memory-limited devices, even for quantized LLMs. This paper introduces a framework to compress LLM after quantization further, achieving about 2.2x compression ratio. A compression-aware quantization is first proposed to enhance model weight compressibility by re-scaling the model parameters before quantization, followed by a pruning method to improve further. Upon this, we notice that decompression can be a bottleneck during practical scenarios. We then give a detailed analysis of the trade-off between memory usage and latency brought by the proposed method. A speed-adaptive method is proposed to overcome it. The experimental results show inference with the compressed model can achieve a 40% reduction in memory size with negligible loss in accuracy and inference speed.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 19 of its 30 references that are in the map. First posted on arXiv 21 Feb 2025.

Builds on

19 of 30 references.

References · 19

  1. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  2. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  3. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
  4. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  5. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
  6. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  7. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  8. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
  9. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  10. 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 992
  11. 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 906
  12. 2019MathQA: Towards Interpretable Math Word Problem Solving with Operation-Based Formalismscited by 662
7 more
  1. 2023FlexGen: High-Throughput Generative Inference of Large Language Models with a Single GPUcited by 575
  2. 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 526
  3. 2021ZeRO-Offload: Democratizing Billion-Scale Model Trainingcited by 341
  4. 2023LLM in a flash: Efficient Large Language Model Inference with Limited Memorycited by 177
  5. 2024LLM Inference Unveiled: Survey and Roofline Model Insightscited by 152
  6. 2024Model Compression and Efficient Inference for Large Language Models: A Surveycited by 64
  7. 2023What Matters In The Structured Pruning of Generative Language Models?cited by 30

Built on by

Cited by year

Citing papers per year: 2025: 3.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024On the Compressibility of Quantized Large Language Models
  2. 2023Compressing LLMs: The Truth is Rarely Pure and Never Simple
  3. 2025Semantic Retention and Extreme Compression in LLMs: Can We Have Both?
  4. 2023A Survey on Model Compression for Large Language Models
  5. 2023The Cost of Compression: Investigating the Impact of Compression on Parametric Knowledge in Language Models
  6. 2025Huff-LLM: End-to-End Lossless Compression for Efficient LLM Inference
  7. 2024LLMC: Benchmarking Large Language Model Quantization with a Versatile Compression Toolkit
  8. 2025A Systematic Study of Compression Ordering for Large Language Models