arXiv Machine Learning By Jiaqi Leng, Minshen Zhang, Zhaofeng Sun, Yu-Yang Qian, Peng Zhao, Hao Zhang

Looping Deeper Without Growing the KV Cache: Recurrent Depth for Causal Encoder-Decoders

Read the original on arXiv Machine Learning →

The paper introduces a looped causal encoder-decoder (CED) architecture that increases model depth without enlarging the key-value (KV) cache across layers and rounds. By placing recurrence in the encoder and allowing sparse encoder layers to generate global KV, the design achieves language‑modeling gains while maintaining long‑context scaling. Experiments show that the Looped CED matches the memory footprint of an unlooped CED and recovers most of a looped Transformer’s performance with significantly less KV, enabling higher throughput on large‑token prompts.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Computation and Language
Nov 5

LooM: Loop-Invariant Memory for Causal Encoder-Decoder Language Models

LooM (Loop‑Invariant Memory) is a technique for causal encoder‑decoder language models that loops only the decoder layers after the first, using a global memory written once per token and publishing key‑value entries only on the first visit. This design prevents the cache from growing with the loop count, allows independent looping of layers to provide any budget from 3 to 21 layer executions per token, and enables a single model trained on randomly sampled budgets to cover all budgets without a router. Experiments show that with enough loops, LooM outperforms a single‑pass baseline on language modeling, zero‑shot accuracy, and long‑context perplexity while using the same cache size.

By Lele Yang, Muxi Diao, Zhonghao Yan, Jiankang Chen, Bin Wen, Tingting Gao, Wentao Zhang, Kongming Liang, Zhanyu Ma, Weiran Xu
arXiv Machine Learning
Oct 23

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

The paper introduces BeNice!, a two‑stage approach that enables KV‑shareability in looped neural architectures. First, stochastic depth during pretraining drives representations toward a common limit across recurrences; second, a post‑training broadcast of the final recurrence’s KV‑cache to earlier recurrences trains the model to produce compatible residuals while preserving quality. BeNice! achieves KV‑shareability without sacrificing validation perplexity and can be combined with other memory‑efficient techniques, yielding significant gains in cache hit rates, throughput, and latency in low‑memory, long‑context inference.

By Hayden Prairie, Jacob M. Ryan, Taylor Berg-Kirkpatrick, Daniel Y. Fu
arXiv Machine Learning
Sep 17

GroupKV: Hierarchical KV Cache Management for Long-Context Diffusion LLM Inference

GroupKV is a lightweight hierarchical KV cache management system designed for long‑context diffusion large language model (dLLM) inference. It partitions the context into contiguous groups and uses coarse‑to‑fine sparse selection, cross‑layer consistency for predictive prefetching, and a staleness correction mechanism to keep the cache coherent amid dynamic KV updates. The approach also incorporates streaming prefill to lower peak memory usage, achieving up to 48× longer serviceable context, 3.73× faster inference in offload‑based settings, and competitive task accuracy.

By Jinhao Wang, Zhexin Hu, Kangjie Zhou, Xin Zhou, Fangfang Liu