Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchMachine learning

analiza aiqbench

This diagnostic study exposes a critical gap in current large language models, revealing that high accuracy on standard reasoning benchmarks does not equate to faithful execution of complex multi-step procedures. As procedural length and dependency complexity increase, model performance degrades significantly due to issues like premature termination and failure to track intermediate variables. These findings are essential for researchers aiming to build reliable AI agents capable of consistent logical workflows rather than just generating plausible-sounding final answers.
Surse care acoperăarXiv, LessWrong, AWS, Viakoo
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

When LLMs Stop Following Steps: A Diagnostic Study of Procedural Execution in Language Models

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2605.00817v4 Announce Type: replace Abstract: Large language models (LLMs) often achieve strong performance on reasoning benchmarks, but final-answer accuracy alone does not show whether they faithfully execute the procedure specified in a prompt. We introduce a controlled diagnostic benchmark for arithmetic procedural execution, where models are given a step-wise arithmetic procedure and two numeric inputs, and must return the final computed value. Complexity is varied through procedure length and look-back dependencies over intermediate variables. Average first-answer accuracy drops from 63% on 5-step procedures to 20\% on 95-step procedures. Generation-level analysis shows that failures often involve missing answers, premature answers, self-correction after an initial error and under-executed traces. These findings reveal a consistent decline in execution performance as arithmetic procedural complexity increases.

Abstract:Large language models (LLMs) often achieve strong performance on reasoning benchmarks, but final-answer accuracy alone does not show whether they faithfully execute the procedure specified in a prompt. We introduce a controlled diagnostic benchmark for arithmetic procedural execution, where models are given a step-wise arithmetic procedure and two numeric inputs, and must return the final computed value. Complexity is varied through procedure length and look-back dependencies over intermediate variables. Average first-answer accuracy drops from 63% on 5-step procedures to 20\% on 95-step procedures. Generation-level analysis shows that failures often involve missing answers, premature answers, self-correction after an initial error and under-executed traces. These findings reveal a consistent decline in execution performance as arithmetic procedural complexity increases.

Computation and Language (cs.CL)

arXiv:2605.00817 [cs.CL]

(or arXiv:2605.00817v4 [cs.CL] for this version)

https://doi.org/10.48550/arXiv.2605.00817 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 209 cuvinte

Subiecte conexe