Hugging Face Trending Papers

Translating KV Caches Between Hybrid-Attention Language Models: MLA Latents, Linear-Attention States and Sparse-Attention Indexers

The paper presents a method for translating key‑value (KV) caches between hybrid‑attention language models, enabling a model to continue a conversation without re‑reading the entire history. It extends prior work (KV‑Lingo) to handle grouped‑query attention, compressed MLA latents, sparse‑attention indexer keys, and fixed‑size linear‑attention states, providing capture‑and‑inject points and mechanisms that preserve native quality. Experiments on 16–48 B hybrid pairs show near‑native performance and significant speedups, while also demonstrating effective long‑range recall and transfer to sparse‑attention targets.

arXiv Machine Learning
Sep 14

Fixed State, Long Reach: What a Constant-Size Cache Buys Block Diffusion at Scale

The paper investigates how block‑diffusion language models can use a constant‑size cache to enable efficient parallel decoding. By employing sequence mixers that summarize completed blocks into a reusable state and a block‑causal training objective, the authors pretrain three 3B block‑diffusion denoisers (attention, Mamba, and hybrid) on 300 B tokens. The resulting state‑space cache remains O(1) in memory and latency regardless of context length, yielding significant speed‑up and memory savings compared to traditional attention‑based caches, especially at very long sequences.

By Vaibhav Singh, Pierre-Andr\'e No\"el, Torsten Scholak, Eugene Belilovsky, Oleksiy Ostapenko
arXiv Computation and Language
Sep 23

LatentPort: Beyond KV Cache - Cross-Model Transfer of Recurrent Memory in Hybrid Language Models: A 4B-to-9B Hybrid-State Handoff Without Target Prefix Replay

The paper introduces LatentPort, a method that allows a language model to transfer its live memory to another model without requiring the receiver to reread the context. Experiments on a Qwen3.5 4B-to-9B sibling pair show that adding a Gated DeltaNet (GDN) persistent-state package reduces negative log‑likelihood by 0.747 nats/token and improves performance across 64 PG19 documents. The study also demonstrates that direct recurrent and convolution reuse outperforms learned GDN maps, and a 434,176‑parameter correction further narrows the performance gap to the native 9B model.

By Simon P. Villani
arXiv Machine Learning
Nov 5

Shallow Encoding Emits Deep Memories

The paper introduces SEED, a method that reduces the computational burden of hybrid language models by making both the prefill and decode phases shallow. SEED exploits two key properties of trained hybrids: (1) deep layer memories can be written efficiently from shallower layers, and (2) recurrent states contain a dominant rank‑one component that can be stored compactly. By freezing the original weights and compressing recurrent states into a sink plus low‑rank factors, SEED achieves near‑lossless performance on large models while boosting per‑GPU throughput by 1.2–1.4× on NVIDIA GB300 GPUs.

By Mingyuan Ma, Yangmin Li, Harris Nover, Zheyu Fu, Po-Han Huang, Alex Settle, Ashwin Nanjappa
arXiv AI
Oct 15

History Replays Itself: Unleashing Long-Context Capability in Linear Attention

arXiv:2610.15715v1 Announce Type: new Abstract: Linear attention promises the efficiency needed for long-context language modelling, yet its fixed-size recurrent state must simultaneously support ong...

By Li Nanbo, Firas Laakom, Yilan Zhang, Piotr Pi\k{e}kos, Yimeng Chen, Liangyu Wang, Yifan Xu, Mateusz Ostaszewski, Dandan Guo, Wenyi Wang, Yanning Dai, Yuhui Wang, J\"{u}rgen Schmidhuber