Recurrent-depth latent reasoning scales test-time compute without extra params
gordic_aleksa · x · 2026-09-17
Gordic Aleksa highlights the underappreciated paper "Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach" (Geiping, Goldstein et al.)
- Iterates a recurrent block to unroll arbitrary depth at test time, reasoning implicitly in latent space instead of emitting more CoT tokens
- Needs no specialized training data, works with small context windows, captures reasoning hard to verbalize
- Proof-of-concept at 3.5B params / 800B tokens shows dramatic benchmark gains, compute load equivalent to 50B params
- Positioned as a third scaling axis beyond parameter count and chain-of-thought length; rumors say frontier labs already use it
Related event: Looped Transformers Gain Attention as a Way to Scale Test-Time Compute(2 posts)→
More from Research
- Asynchronous Flow Map Language Models Generate All Tokens in a Single Forward Pass — kalyan_kpl · 2026-11-02
- NVIDIA's Kumo Is a Family of Four Tabular Foundation Models, Not Just One — pandeyparul · 2026-11-02
- Economist Aaroth: fast agreement dynamics survive without Bayesian updates or accurate priors — Aaroth · 2026-11-02
- ELLIS names 160 new ML Fellows and Scholars for 2025–2026 — JJitsev · 2026-11-02
- Meme turn 50: Aumann's 'Agreeing to Disagree' paper anniversary — Aaroth · 2026-11-02
- Anthropic: analysts unknowingly adopted their agent's secret lean 86% of the time — shoumikgoswami · 2026-11-02