mlsanityData to 7 Oct 2026

CARVQ: Corrective Adaptor with Group Residual Vector Quantization for LLM Embedding Compression

arXiv 2510.12721 ↗First posted 14 Oct 2025cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Large Language Models (LLMs) typically rely on a large number of parameters for token embedding, leading to substantial storage requirements and memory footprints. In particular, LLMs deployed on edge devices are memory-bound, and reducing the memory footprint by compressing the embedding layer not only frees up the memory bandwidth but also speeds up inference. To address this, we introduce CARVQ, a post-training novel Corrective Adaptor combined with group Residual Vector Quantization. CARVQ relies on the composition of both linear and non-linear maps and mimics the original model embedding to compress to approximately 1.6 bits without requiring specialized hardware to support lower-bit storage. We test our method on pre-trained LLMs such as LLaMA-3.2-1B, LLaMA-3.2-3B, LLaMA-3.2-3B-Instruct, LLaMA-3.1-8B, Qwen2.5-7B, Qwen2.5-Math-7B and Phi-4, evaluating on common generative, discriminative, math and reasoning tasks. We show that in most cases, CARVQ can achieve lower average bitwidth-per-parameter while maintaining reasonable perplexity and accuracy compared to scalar quantization. Our contributions include a novel compression technique that is compatible with state-of-the-art transformer quantization methods and can be seamlessly integrated into any hardware supporting 4-bit memory to reduce the model's memory footprint in memory-constrained devices. This work demonstrates a crucial step toward the efficient deployment of LLMs on edge devices.

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

Builds on

18 of 31 references.

References · 18

  1. 2024The Llama 3 Herd of Modelscited by 14,192
  2. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  3. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  4. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
  5. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  6. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  7. 2016Pointer Sentinel Mixture Modelscited by 2,992
  8. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  9. 2024Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvementcited by 1,057
  10. 2024SpinQuant: LLM quantization with learned rotationscited by 446
  11. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
  12. 2016Using the Output Embedding to Improve Language Modelscited by 266
6 more
  1. 2024Extreme Compression of Large Language Models via Additive Quantizationcited by 223
  2. 2023HiFi-Codec: Group-residual Vector quantization for High Fidelity Audio Codeccited by 95
  3. 2024GPTVQ: The Blessing of Dimensionality for LLM Quantizationcited by 78
  4. 2024Residual Quantization with Implicit Neural Codebookscited by 24
  5. 2024BitMoD: Bit-serial Mixture-of-Datatype LLM Accelerationcited by 12
  6. 2024Dynamic Vocabulary Pruning in Early-Exit LLMscited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.