Paper recorded by Signals 4 on 2026-10-09 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-10-09 on arXiv · recorded by Signals 4 on 2026-10-12
Category: cs.LG · 机器学习 · first seen 2026-10-12
Coding agents often make useful progress before they fail, but retry-from-scratch discards the machine state created along the way. This makes failure recovery an interesting search problem: if intermediate environment states preserve meaningful progress, restoring and branching from them could outperform repeatedly restarting from the initial state. We implement Go-Explore-style search over full