arXiv Computation and Language By Lele Yang, Muxi Diao, Zhonghao Yan, Jiankang Chen, Bin Wen, Tingting Gao, Wentao Zhang, Kongming Liang, Zhanyu Ma, Weiran Xu

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

Read the original on arXiv Computation and Language →

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.

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 Computation and Language.

arXiv Machine Learning
6d ago

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

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.

By Jiaqi Leng, Minshen Zhang, Zhaofeng Sun, Yu-Yang Qian, Peng Zhao, Hao Zhang
arXiv AI
Oct 5

The Surprising Effectiveness of Shared Memory in Looped Transformers

The paper introduces a method for looped transformers that share a key‑value cache across recursions, reducing memory usage without sacrificing quality. Experiments show that the Looped Prediction Transformer (LPT) and its hybrid variant achieve lower perplexity on FineWeb‑Edu while using 76‑79% less context memory compared to standard transformers. Analysis reveals that shared memory develops distinct representations and serves as a gradient highway, enabling later recursions to focus on shared information.

By Giovanni Monea, Keshav Ramji, Yousef El-Kurdi, Luis A. Lastras, Yoav Artzi, Nathan Godey, Ram\'on Fernandez Astudillo
Hugging Face Trending Papers
Jun 8

End-to-End Context Compression at Scale

Long-context language model inference is bottlenecked by memory, as the KV cache grows with context length. Recent techniques to compress the KV cache fall short: they either degrade model quality substantially or require considerable time and compute to compress a single long prompt.