about
The Illusion of Diminishing Returns: Measuring Long Horizon Execution in LLMs (arxiv.org)
1 point by simonpure on Sep 29, 2025 | hide | past | pdf | discuss on HN

In plain words: Measuring how many steps a model executes when handed the knowledge and plan shows small single-step gains compound into much longer tasks. Bigger models lasted far longer even when small ones were near-perfect at one step, and thinking curbed the spiral of past mistakes.

Abstract

Does continued scaling of large language models (LLMs) yield diminishing returns? In this work, we show that short-task benchmarks may give an illusion of slowing progress, as even marginal gains in single-step accuracy can compound into exponential improvements in the length of tasks a model can successfully complete. Then, we argue that failures of LLMs when simple tasks are made longer arise from mistakes in execution, rather than an inability to reason. So, we propose isolating execution capability, by explicitly providing the knowledge and plan needed to solve a long-horizon task. First, we find that larger models can correctly execute significantly more turns even when small models have near-perfect single-turn accuracy. We then observe that the per-step accuracy of models degrades as the number of steps increases. This is not just due to long-context limitations -- curiously, we observe a self-conditioning effect -- models become more likely to make mistakes when the context contains their errors from prior turns. Self-conditioning does not reduce by just scaling the model size. But, we find that thinking mitigates self-conditioning, and also enables execution of much longer tasks in a single turn. We conclude by benchmarking frontier thinking models on the length of tasks they can execute in a single turn. Overall, by focusing on the ability to execute, we hope to reconcile debates on how LLMs can solve complex reasoning problems yet fail at simple tasks when made longer, and highlight the massive benefits of scaling model size and sequential test-time compute for long-horizon tasks.

Akshit Sinha, Arvindh Arun, Shashwat Goel, Steffen Staab, Jonas Geiping
arXiv:2509.09677 · cs.AI · submitted Sep 11, 2025 · updated Mar 13, 2026
abstract · pdf · html · Published at ICLR 2026

add comment on HN
Also discussed: Sep 2025 (1 point, 0 comments) · Sep 2025 (3 points, 0 comments) · Sep 2025 (2 points, 0 comments) · Sep 2025 (4 points, 0 comments) · Sep 2025 (3 points, 1 comment)