原帖引用 · 原文
New UCLA and AWS paper finds that AI agents can solve hard math problems by spotting hidden shortcuts, but the time they spend thinking often cancels out the time the shortcut saves.
Standard algebra solvers always reach a correct answer, but some problems take them far too long. Rewriting a problem around its hidden structure can be far faster, but spotting it usually takes an expert.
They gave Claude Opus 5 agents polynomial systems with hidden shortcuts and counted its thinking time as cost. They tested fresh solving, solving related problems with saved notes, and building a reusable solver upfront.
The agent solved 103 of 108 systems within 600 s, versus 60 for plain msolve, yet was faster on only 12 of those 60. Compiled solvers ran 5.4x faster than a baseline given the known shortcut, after 11.4 hours of setup.
Use agents on problems standard solvers cannot finish, and build a reusable solver only when enough similar problems will repay its setup.