Structure-Induced Information for Rerooting Levin Tree Search

ArXi:2605.30664v1 Announce Type: new Subgoal-based policy tree search, which uses a policy to guide search, is effective for complex single-agent deterministic problems but often relies on explicit subgoal generation that can incur substantial overhead and hinders scalability. In this paper, we overcome these limitations by using a learned ``rerooter'' through the recently-