cd /news/large-language-models/lead-breaking-the-no-recovery-bottle… · home topics large-language-models article
[ARTICLE · art-72221] src=machinelearning.apple.com ↗ pub= topic=large-language-models verified=true sentiment=↑ positive

LEAD: Breaking the No-Recovery Bottleneck in Long-Horizon Reasoning

A new method called Lookahead-Enhanced Atomic Decomposition (LEAD) breaks the no-recovery bottleneck in long-horizon reasoning for Large Language Models, enabling the o4-mini model to solve Checkers Jumping puzzles up to complexity n=13, whereas extreme decomposition fails beyond n=11. The research by Denys Pushkin and Emmanuel Abbé shows that while decomposition is essential for stability, extreme decomposition creates irreversible errors on hard steps, which LEAD addresses through short-horizon future validation and overlapping rollouts.

read2 min views1 publishedJul 24, 2026
LEAD: Breaking the No-Recovery Bottleneck in Long-Horizon Reasoning
Image: Apple ML Research

content type paperpublished July 2026 LEAD: Breaking the No-Recovery Bottleneck in Long-Horizon Reasoning

AuthorsDenys Pushkin†, Emmanuel Abbé†

LEAD: Breaking the No-Recovery Bottleneck in Long-Horizon Reasoning

AuthorsDenys Pushkin†, Emmanuel Abbé†

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.

Divide-or-Conquer? Which Part Should You Distill Your LLM?

October 25, 2024research area Speech and Natural Language Processingconference EMNLP Recent methods have demonstrated that Large Language Models (LLMs) can solve reasoning tasks better when they are encouraged to solve subtasks of the main task first. In this paper we devise a similar strategy that breaks down reasoning tasks into a problem decomposition phase and a problem solving phase and show that the strategy is able to outperform a single stage solution. Further, we hypothesize that the decomposition should be easier to…

Joint Learning of Portrait Intrinsic Decomposition and Relighting

July 28, 2021research area Computer Vision Inverse rendering is the problem of decomposing an image into its intrinsic components, i.e. albedo, normal and lighting. To solve this ill-posed problem from single image, state-of-the-art methods in shape from shading mostly resort to supervised training on all the components on either synthetic or real datasets. Here, we propose a new self-supervised training paradigm that 1) reduces the need for full supervision on the decomposition task and…

── more in #large-language-models 4 stories · sorted by recency
── more on @denys pushkin 3 stories trending now
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
Live at https://your-agent.zahid.host
Get free account → Pricing
from €0/mo · no card required
LIVE [news/lead-breaking-the-no…] indexed:0 read:2min 2026-07-24 ·