Structure-Induced Information for Rerooting Levin Tree Search

This paper introduces novel rerooter designs for the $\sqrt{\text{LTS}}$ algorithm, addressing the scalability limitations of explicit subgoal generation in subgoal-based policy tree search. These designs implicitly decompose problems, enabling scalable allocation of search effort.