LoopVQ Enables Sub 1-Bit KV Cache Quantization for Looped Transformers
First merged summary.
LoopVQ jointly quantizes channels across loop steps for sub 1-bit KV cache in looped transformers while preserving accuracy and halving decode latency at 32K context.
Looped transformers reuse layers for efficiency but store growing KV cache per step. LoopVQ codes channels jointly across multiple loop steps and fine-tunes codebooks. At 0.5 bits per element it outperforms existing methods on long chain-of-thought and retrieval tasks. Combined with TaSQ it retains BF16 accuracy at 0.25 bits per element. The approach nearly halves decode latency at 32K context and raises peak serving throughput by up to 4.3x on 1.4B and 6.1x on 2.6B Ouro models.
- Joint channel coding for multiple loop steps
- 0.5 bits per element outperforms existing KV cache methods
- Retains BF16 accuracy at 0.25 bits with TaSQ
- Halves decode latency at 32K-token context
- Up to 4.3x and 6.1x throughput on 1.4B and 2.6B Ouro models
What each outlet adds
beyond the shared facts- Hugging Face daily papersOutperforms on general long chain-of-thought and retrieval tasks, plus SGLang latency halving
- arXivPeak throughput gains of 4.3x and 6.1x on 1.4B and 2.6B Ouro models
Coverage
oldest first · one row per article · UTCLoopVQ sub-1-bit KV cache quantization for looped transformers
LoopVQ jointly quantizes channels across multiple loop steps in looped transformers to reduce memory while preserving accuracy.
LoopVQ enables sub 1-bit KV cache quantization for looped transformers
LoopVQ quantizes KV cache at 0.5 bits per element for looped transformers, nearly halving decode latency at 32K context.