연구
Structure-Induced Information for Rerooting Levin Tree Search
arXiv:2605.30664v1 Announce Type: new Abstract: Subgoalbased policy tree search, which uses a policy to guide search, is effective for complex singleagent deterministic problems but often relies on explicit subgoal generation that can incur substantial overhead and hinders scalability.
이 콘텐츠는 ArXiv AI 원본 기사의 요약입니다. 전문은 원본 사이트에서 확인해주세요.
원문 기사 보기 →