Reproduce “Root-Cause Attribution Is a Search Problem: Continual Search for Long-Horizon Agent Failures” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Harsh Raj, David Lee, Anas Mahmoud, Renxiong Wang, Razvan-Gabriel Dumitru, Chenguang Wang, Tong Zhao, Yunzhong He and 2 more
The authors introduce Continual Search, a method for root-cause attribution that prompts a judge to examine unresolved or unread evidence across successive turns. On MegaRCA-Mix, Opus-4.8’s F1 rises from 0.471 with a single-turn judgment to 0.608 through Turn 4, versus 0.479 with passive continuation. Gains occur on the three largest-log settings, not consistently on shorter ones.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.