Signals 4 · free daily AI digest

BeNice! Closing Looping's Inference-Memory Gap via KV-Sharing

Paper recorded by Signals 4 on 2026-10-22 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-10-22 on arXiv · recorded by Signals 4 on 2026-10-23

Category: cs.LG · 机器学习 · first seen 2026-10-23

Abstract

Looped architectures scale quality while keeping parameter count fixed by repeatedly passing activations through the same block of layers. During inference, each recurrence generates independent KV-caches, causing memory to grow linearly. To address this challenge, prior work has proposed KV-sharing (i.e., sharing KV-caches across depth), finding that, in some cases, the KV-cache of the final recu

Read on arXiv →

#196 most recent of 749 cs.LG papers we have recorded · ↑ newer: A Fix for Softmax and Cross-Entropy · ↓ older: OP-Print: Tracing Membership Imprints in On-Policy Self-Distillation
Cite this page: BeNice! Closing Looping's Inference-Memory Gap via KV-Sharing: the #196 most recent of 749 cs.LG papers we have recorded (as of 2026-10-22). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/benice-closing-looping-s-inference-memory-gap-via-kv-sharing.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.LG papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions