LEAD: Breaking the No-Recovery Bottleneck in Long-Horizon Reasoning
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
Long-horizon execution in Large Language Models (LLMs) remains unstable even when high-level strategies are provided. Evaluating on controlled algorithmic puzzles, we demonstrate that while decomposition is essential for stability, extreme decomposition creates a "no-recovery bottleneck". We show that this bottleneck becomes critical due to highly non-uniform error distribution, where consistent errors on a few "hard" steps become irreversible. To address this, we propose Lookahead-Enhanced Atomic Decomposition (LEAD). By incorporating short-horizon future validation and aggregating overlapping rollouts, LEAD provides enough isolation to maintain stability while retaining enough local context to correct errors. This enables the o4-mini model to solve Checkers Jumping up to complexity n=13, whereas extreme decomposition fails beyond n=11.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 18 of its 40 references that are in the map. First posted on arXiv 6 Mar 2026.
Builds on
18 of 40 references.
Closest ancestors · 3
Same direction, newest first
- 2025The Markovian Thinker: Architecture-Agnostic Linear Scaling of Reasoning8 Oct
- 2025The Illusion of Thinking: Understanding the Strengths and Limitations of Reasoning Models via the Lens of Problem Complexity7 Jun
- 2023Tree of Thoughts: Deliberate Problem Solving with Large Language Models17 May
Other references · 15
- 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,455
- 2022Least-to-Most Prompting Enables Complex Reasoning in Large Language Modelscited by 1,407
- 2022Measuring and Narrowing the Compositionality Gap in Language Modelscited by 1,075
- 2023Plan-and-Solve Prompting: Improving Zero-Shot Chain-of-Thought Reasoning by Large Language Modelscited by 560
- 2019Lookahead Optimizer: k steps forward, 1 step backcited by 336
- 2023What Algorithms can Transformers Learn? A Study in Length Generalizationcited by 199
- 2025Artificial Hivemind: The Open-Ended Homogeneity of Language Models (and Beyond)cited by 141
- 2025Context Length Alone Hurts LLM Performance Despite Perfect Retrievalcited by 127
- 2025The Illusion of Diminishing Returns: Measuring Long Horizon Execution in LLMscited by 64
- 2024MegaAgent: A Large-Scale Autonomous LLM-based Multi-Agent System Without Predefined SOPscited by 47
- 2025Context as a Tool: Context Management for Long-Horizon SWE-Agentscited by 43
- 2024Not All LLM Reasoners Are Created Equalcited by 30
3 more
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026Empirical Evidence of Complexity-Induced Limits in Large Language Models on Finite Discrete State-Space Problems with Explicit Validity Constraints
- 2025seqBench: A Tunable Benchmark to Quantify Sequential Reasoning Limits of LLMs
- 2025Beyond Exponential Decay: Rethinking Error Accumulation in Large Language Models
- 2026A Decomposition Perspective to Long-context Reasoning for LLMs
- 2026SokoBench: Evaluating Long-Horizon Planning and Reasoning in Large Language Models
- 2026Intrinsic Stability Limits of Autoregressive Reasoning: Structural Consequences for Long-Horizon Execution
- 2025From Implicit Exploration to Structured Reasoning: Leveraging Guideline and Refinement for LLMs
- 2026Wrong Prediction, Right Answer: Recovering Evidence from Collapsed LLM Sequence Scores