Looped Latent Attention Compresses Transformer K/V Caches

James O' Neill, Fergal Reid· July 20, 2026 View original

Summary

This research introduces Looped Latent Attention (LLA), a post-training codec that significantly compresses the K/V cache in looped Transformers by exploiting the low-rank structure of recurrent cache vectors. LLA reconstructs loop-specific K/V vectors only when needed, leading to substantial memory savings and increased batch capacity.

Looped Transformers, which reuse a single block to reduce parameters, typically store a separate K/V cache for each recurrence step during decoding. This paper identifies that these loop-indexed cache vectors exhibit a highly structured, low-rank trajectory across loops. To address the memory overhead, the researchers propose Looped Latent Attention (LLA), a post-training codec that stores compact K and V latents. LLA reconstructs the full K/V vectors only when required by the attention mechanism. This method achieves significant compression, outperforming other techniques like head-axis MLA and KV quantization. The approach has been shown to increase batch capacity substantially, for instance, boosting Ouro-1.4B batch capacity from 32 to 768 sequences at 4k context with 21.3x compression on an H200 GPU.

Why it matters

Professionals building or deploying large language models can leverage this technique to reduce memory footprint and increase inference batch sizes, leading to more efficient and cost-effective operations, especially for long context windows.

How to implement this in your domain

  1. 1Evaluate current Transformer models for K/V cache memory bottlenecks, particularly with long sequences.
  2. 2Integrate the Looped Latent Attention codec into existing model deployment pipelines.
  3. 3Benchmark the performance gains in terms of batch capacity and inference speed on target hardware.
  4. 4Consider fine-tuning the codec with distillation techniques for optimal performance on specific tasks.

Who benefits

AI/ML InfrastructureCloud ComputingHigh-Performance ComputingTelecommunications

Key takeaways

  • Looped Latent Attention significantly compresses K/V caches in Transformers.
  • The technique exploits the low-rank structure of recurrent cache vectors.
  • It leads to substantial increases in inference batch capacity and efficiency.
  • LLA outperforms other compression methods for recurrent caches.

Original post by James O' Neill, Fergal Reid

"arXiv:2607.15456v1 Announce Type: new Abstract: Looped, weight-tied Transformers reduce parameters by reusing a block, but decoding still stores a separate K/V cache for every recurrence step. We show that this loop-indexed cache is highly structured. For a fixed token, layer and…"

View on X

Originally posted by James O' Neill, Fergal Reid on X · view source

Want to go deeper?

Turn these trends into skills with Learnijoy's hands-on AI & tech courses.

Explore courses