Weighted State Souping for Efficient Long-Context Retrieval

Apple ML Research··

This paper was accepted at the Workshop on Personalized, Aligned, Long-term Memory for AI Systems (PALM) at NeurIPS 2026. State space models (SSMs) combine fast inference and fixed state size with competitive language-modeling performance. Recently, state souping has been proposed as a procedure whereby an SSM independently encodes chunks of tokens like documents, tool definitions, or memory records. The resulting state encodings may be cached and recombined to cheaply construct a context for do...

Read full article →

Related Articles

OpenAI’s o1 correctly diagnosed 67% of ER patients vs. 50-55% by triage doctors
donsupreme · Hacker News · 6mo ago
Accelerating Gemma 4: faster inference with multi-token prediction drafters
amrrs · Hacker News · 6mo ago
A couple million lines of Haskell: Production engineering at Mercury
unignorant · Hacker News · 6mo ago
Using “underdrawings” for accurate text and numbers
samcollins · Hacker News · 6mo ago
ProgramBench: Can language models rebuild programs from scratch?
jonbaer · Hacker News · 6mo ago