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
- Why mathematicians have a point about AI proofs: models hunt trophies, not exploration — _lewtun · 2026-09-17
- TMLR tightens desk rejections as submissions surge, quizzes authors on their own papers — thegautamkamath · 2026-09-17
- ModernBERT Contributor Confirms: Multi-Head Training With 1K Examples Works Now — alexisgallagher · 2026-09-17
- ModernBERT Contributor: Train Multiple Heads With ~1K Examples in an Afternoon — alexisgallagher · 2026-09-17
- CHOP uses AI to cut children's heart 3D modeling from 4 hours to seconds — kimmonismus · 2026-09-17
- Liouville Goldbach Conjecture Fully Proven and Lean-Verified, Code Released on GitHub — ctjlewis · 2026-09-17