Semantic Retention and Extreme Compression in LLMs: Can We Have Both?

Stanislas Laborde, Martin Cousseau, Antoun Yaacoub, Lionel Prevost
5/12/2025
cs.CLcs.AIcs.LG

No confident code implementation found for this paper.

Abstract

The exponential growth in Large Language Model (LLM) deployment has intensified the need for efficient model compression techniques to reduce computational and memory costs. While pruning and quantization have shown promise, their combined potential remains largely unexplored. In this paper, we examine joint compression and how strategically combining pruning and quantization could yield superior performance-to-compression ratios compared to single-method approaches. Recognizing the challenges in accurately assessing LLM performance, we address key limitations of previous evaluation frameworks and introduce the Semantic Retention Compression Rate (SrCr), a novel metric that quantifies the trade-off between model compression and semantic preservation, facilitating the optimization of pruning-quantization configurations. Experiments demonstrate that our recommended combination achieves, on average, a 20% performance increase compared to an equivalent quantization-only model at the same theoretical compression rate.

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{laborde2025semantic,
  title  = {Semantic Retention and Extreme Compression in LLMs: Can We Have Both?},
  author = {Stanislas Laborde and Martin Cousseau and Antoun Yaacoub and Lionel Prevost},
  year   = {2025},
  eprint = {2505.07289},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.07289v1}
}

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

Discussion