Looped Latent Attention: compressing KV caches across loops¶
Fidelity: core mechanism. Trains a weight-shared looped block and stores K/V in shared latents.
Paper information¶
| Field | Details |
|---|---|
| Paper | arXiv 2607.15456 |
| Organization | University of Maryland / Meta AI |
| First public release | 2026-07-16 (arXiv v1) |
| Authors' code | The paper did not provide official or author code when checked on 2026-08-09. |
| Adapter / method | looped-latent-attention |
| Local reproduction code | src/auto_research/reproductions/looped_latent_attention/ |
Original paper¶
Motivation and method¶
Looped Transformers reuse weights but still duplicate KV caches across loops. LLA learns shared low-rank K/V latents and reconstructs loop-specific K/V during serving, exploiting recurrence redundancy for near-lossless compression.
flowchart LR
H["Shared loop block"] --> L["K/V latent codec"]
L --> K1["Loop 1 K/V"]
L --> K2["Loop 2 K/V"]
L --> KN["Loop N K/V"]
K1 --> A["Attention"]
K2 --> A
KN --> A
Key figure from the paper¶
Figure 1: Overview of the paper's method and key components. From the original paper; copyright remains with the authors.
Core equations¶
Paper results¶
Near-lossless KV compression reaches 32×; at 4× compression, MATH-500 improves from 0.43 to 0.66. These are offline and serving results, so the online A/B admission criterion does not apply.
Local reproduction¶
Local comparison: The baseline is two-layer
llama_modern. The treatment loops a shared block twice and uses 2× K/V latents. LM loss moves5.7471→5.8012, or +0.94% worse; parameters move139584→80576.
Parameters fall 42.3%, but short-run perplexity rises 5.56%. See the metrics.
auto-research reproduce --paper looped-latent-attention --dataset-dir data --seed 42
auto-research evolve --model micro-llm --dataset wikitext-2 --direction "Looped Latent Attention KV 压缩"
Reproduction boundaries¶
A width-64 model is trained from scratch. No post-hoc codec is fitted to a large checkpoint, and no fused serving kernel is used.
