Skip to content
Sagan

Paper

Structure-Induced Information for Rerooting Levin Tree Search

Unreadunread

AI summary

arXiv:2605. 30664v1 Announce Type: new Abstract: 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.