Fetching from the wire…
Public story · 2026-08-10 · high
Compressed video memory breaks because RoPE positions fall outside training range, and a training-free fix lifts recall 19.5% on a new benchmark.
Why now: WorldTrace posted on arXiv in August 2026 alongside LoopBench, the first benchmark built to isolate this exact failure.
Video world models lose memory once rollouts run past their training horizon, per the WorldTrace paper. That's a problem for anyone building agents or simulators that depend on long, coherent rollouts. WorldTrace's fix recovers up to 19.5% of that lost episodic recall on the new LoopBench benchmark.
The root cause is RoPE, the positional encoding these models use to track time across frames. Long rollouts push those offsets past the range the model trained on, so attention can't reliably address older stored content.
Naive cache compression makes it worse, per the paper. It averages positional phases that don't match, scrambling the slots meant to hold memory.
WorldTrace's fix skips retraining. It gives each compressed memory slot its own valid position instead of an averaged one. Two versions test the idea: Field, tuned for temporal coherence, and Landmark, tuned for verbatim episodic recall. On LoopBench, Field improved temporal consistency 15.5% and Landmark improved episodic recall 19.5%.
The forgetting looks like a hard memory ceiling, but it's actually a bug in how compressed positions get indexed, fixable without retraining a single weight. If that holds up, other long-context video claims are worth re-checking against how their caches assign position, not just how large the advertised window is.
Each link below shares sources, entities, or timing with this story.
Every AI-productivity fight this year has been three people quoting three studies at each other. Field experiments say +26% more tasks per week. METR's randomized trial says a 19% slowdown. Team telemetry says code review time up 441%. Pick your number, pick your priors, argue...
Sebastian Raschka's July 28 teardown argues K3 is less exotic than the release framing suggests: a scaled production version of Kimi Linear with Kimi Delta Attention as the hybrid attention layer and LatentMoE compressing large linear layers by down-projection. The genuinely n...
The paper uses gated linear attention for O(N)-dominated mixing with periodic gated-softmax anchors at 3:1, plus Block Attention Residuals raising effective rank about 12%. 5B and 14B models produce 720p on a single GPU: 13.06 seconds for a 720p 5-second clip fully optimized,...
PR #21038 adds graph-level Hadamard rotation of Q/K/V before caching, doing attention in the rotated space then rotating back, which makes standard quant types far more accurate in the KV cache. The benchmarks are not subtle: Qwen3 0.6B q5_1 KV perplexity drops from ~61.7 to ~...
Nearly all cache-compaction research assumes a static context where future queries are known offline, which agents never have. Comparing token eviction against attention matching across proxy-query sources on BrowseComp-Plus and WideSearch, compacting a turn immediately often...
It compresses fine-grained local features bottom-up into a small set of proxy states per layer, runs global attention only in that compressed space, then decompresses and injects back into a local stream that persists across layers, so information one compression step misses s...
MindPattern daily
One email a day at 7 AM. Sources and a take on every story. Unsubscribe anytime.