---
title: "LoopKV: Loop-Aware KV Cache Compression for Serving Looped Transformers"
source: "arXiv AI/CL/LG（论文）"
source_tier: "t2"
url: "https://arxiv.org/abs/2611.04137v1"
permalink: "https://feed.astralor.com/items/itm_ceda56e2b0515f7da8ee9e42"
published: "2026-11-03T01:28:57.000Z"
score: 59
channel: "tech"
tags: ["LLM","推理效率","RAG","LoopKV","Loop-Aware","Cache Compression","Serving Looped Transformers","Looped"]
---

# LoopKV: Loop-Aware KV Cache Compression for Serving Looped Transformers

## At a glance

Looped transformers apply a shared block several times per token to improve accuracy without adding parameters. For models such as Ouro that keep a separate key-value (KV) cache per loop, cache memory limits the batch s…

## Key points

- Looped transformers apply a shared block several times per token to improve accuracy without adding parameters.
- For models such as Ouro that keep a separate key-value (KV) cache per loop, cache memory limits the batch size that amortizes repeated weight reads.
- Uniform-bit quantization and fixed rules per loop do not allocate precision according to each layer's sensitivity in each loop.

## Full text

Looped transformers apply a shared block several times per token to improve accuracy without adding parameters. For models such as Ouro that keep a separate key-value (KV) cache per loop, cache memory limits the batch size that amortizes repeated weight reads. Uniform-bit quantization and fixed rules per loop do not allocate precision according to each layer's sensitivity in each loop. Measurements on Ouro show that quantization sensitivity varies across (loop, layer) cells, and the sum of individual cell damages approximates the overall output damage. Sharing damage also varies by cell, with later loops generally tolerating sharing better. Skipping low-attention values to save reads produces errors that compound across loops. LoopKV uses a one-time offline profile to choose 4-bit storage, 2-bit storage or reuse of the final loop's KV for each cell. The planner minimizes reads under budgets for predicted damage and storage. During decoding, each loop reads the high 2 bits of each 4-bit value and fetches the low bits only where its own attention weights require 4-bit precision. A single fused kernel in vLLM executes the plan. Serving Ouro-1.4B on one RTX PRO 6000, the memory-optimized LoopKV-M plan stores 35% less KV than uniform 4-bit quantization (KIVI-4) on the same fused kernel and CUDA graph. It sustains 1.7-2.2x KIVI-4's goodput under a latency service-level objective with a 16K-token maximum length. None of its averages on six public benchmarks falls significantly below BF16's.

---

Verify against the original before citing; curated by Astral Feed: https://feed.astralor.com/items/itm_ceda56e2b0515f7da8ee9e42