mlsanityData to 7 Oct 2026

Echo: KV-Cache-Free Associative Recall with Spectral Koopman Operators

arXiv 2605.06997 ↗First posted 7 May 2026cs.LGcited by 1

On the map: LLM reasoning → Test-time compute and efficient thinking

also in 2 more
Abstract (arXiv)

Long chain-of-thought reasoning and agentic tool-calling produce traces spanning tens of thousands of tokens, yet Transformer KV caches grow linearly with sequence length, creating a memory bottleneck on commodity hardware. State-space models offer constant-memory recurrence but suffer a memory cliff: retrieval accuracy collapses once the gap between a stored fact and its query exceeds the effective horizon of the recurrent state. We introduce Echo, a KV-cache-free associative recall architecture built around Spectral Koopman Attention (SKA); a drop-in replacement for attention layers that augments SSM blocks with a closed-form dynamical operator whose sufficient statistics are accumulated in constant memory with no KV cache. Echo fits a spectral linear system to the key and value history via kernel ridge regression and retrieves through a learned power-iterated filter, all from O(r2) streaming state where r is a small projection rank. On the Multi-Query Associative Recall benchmark, a pure Mamba-2 SSM fails to exceed chance accuracy (~3%) across all gap lengths and KV-pair counts, while at the 50M parameter scale SKA-augmented models achieve 100% retrieval accuracy on every configuration tested, including distractor gaps of 4,096 tokens with 32 KV pairs. Across five additional transfer benchmarks including needle-in-a-haystack, tool-trace, and multi-hop retrieval, SKA consistently outperforms both pure SSM and SSM+Attention hybrids while maintaining constant inference memory. Ablations confirm that the spectral operator, not the prefix masking strategy, drives the retrieval gain.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 28 of its 39 references that are in the map. First posted on arXiv 7 May 2026.

Builds on

28 of 39 references.

Closest ancestors · 2

Same direction, newest first

  1. 2026Mamba-3: Improved Sequence Modeling using State Space Principles16 Mar
  2. 2025Inference-Time Hyper-Scaling with KV Cache Compression5 Jun

Other references · 26

  1. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  2. 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
  3. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  4. 2016Pointer Sentinel Mixture Modelscited by 2,992
  5. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  6. 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,424
  7. 2020GLU Variants Improve Transformercited by 1,724
  8. 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,283
  9. 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,104
  10. 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
  11. 2024SnapKV: LLM Knows What You are Looking for Before Generationcited by 848
  12. 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Modelscited by 805
14 more
  1. 2022Simplified State Space Layers for Sequence Modelingcited by 776
  2. 2022What learning algorithm is in-context learning? Investigations with linear modelscited by 671
  3. 2017Deep learning for universal linear embeddings of nonlinear dynamicscited by 491
  4. 2024Jamba: A Hybrid Transformer-Mamba Language Modelcited by 390
  5. 2024Parallelizing Linear Transformers with the Delta Rule over Sequence Lengthcited by 373
  6. 2022Diagonal State Spaces are as Effective as Structured State Spacescited by 350
  7. 2024Repeat After Me: Transformers are Better than State Space Models at Copyingcited by 208
  8. 2019WinoGrande: An Adversarial Winograd Schema Challenge at Scalecited by 194
  9. 2023Zoology: Measuring and Improving Recall in Efficient Language Modelscited by 188
  10. 2023One Step of Gradient Descent is Provably the Optimal In-Context Learner with One Layer of Linear Self-Attentioncited by 168
  11. 2025MesaNet: Sequence Modeling by Locally Optimal Test-Time Trainingcited by 37
  12. 2026Lost in Backpropagation: The LM Head is a Gradient Bottleneckcited by 6
  13. 2026Preconditioned DeltaNet: Curvature-aware Sequence Modeling for Linear Recurrencescited by 5
  14. 2026Training Dynamics of Softmax Self-Attention: Fast Global Convergence via Preconditioningcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026Remembering Distinct Items, Not Tokens: A Learnable Dirichlet-Process Cache Between State-Space Models and Attention
  2. 2025LoLA: Low-Rank Linear Attention With Sparse Caching
  3. 2026RunningTensor: Generalizing Linear Attention to Higher-Order Recurrent States
  4. 2026MKA: Memory-Keyed Attention for Efficient Long-Context Reasoning
  5. 2026Kernelized Linear Attention: Breaking the Capacity Wall with Symmetric Cones
  6. 2026ARM: Attention with Routed-Memory for Learnable Sparse Control
  7. 2025REAL: REtrieval-reAsoning and Logic-constructed Attention Behaviors for Long-Context KV Cache Compression
  8. 2026SchemaMem: Schema-Indexed Recurrent Memory for Delayed State Retrieval