Three rerooter designs (clustering-based, heuristic-based, hybrid) for √LTS enable scalable search in complex single-agent environments where explicit subgoal methods fail and achieve SOTA online training efficiency.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Structure-Induced Information for Rerooting Levin Tree Search
Three rerooter designs (clustering-based, heuristic-based, hybrid) for √LTS enable scalable search in complex single-agent environments where explicit subgoal methods fail and achieve SOTA online training efficiency.