In-Person Oral presentation / top 5% paper

Fast and Precise: Adjusting Planning Horizon with Adaptive Subgoal Search

Michał Zawalski · Michał Tyrolski · Konrad Czechowski · Tomasz Odrzygóźdź · Damian Stachura · Piotr Piękos · Yuhuai Wu · Łukasz Kuciński · Piotr Miłoś

[ Abstract ] [ Livestream: Visit Oral 3 Track 1: Reinforcement Learning ]
Tue 2 May 2:10 a.m. — 2:20 a.m. PDT

Complex reasoning problems contain states that vary in the computational cost required to determine the right action plan. To take advantage of this property, we propose Adaptive Subgoal Search (AdaSubS), a search method that adaptively adjusts the planning horizon. To this end, AdaSubS generates diverse sets of subgoals at different distances. A verification mechanism is employed to filter out unreachable subgoals swiftly, making it possible to focus on feasible further subgoals. In this way, AdaSubS benefits from the efficiency of planning with longer-term subgoals and the fine control with shorter-term ones, and thus scales well to difficult planning problems. We show that AdaSubS significantly surpasses hierarchical planning algorithms on three complex reasoning tasks: Sokoban, the Rubik’s Cube, and the inequality-proving benchmark INT.

Chat is not available.