Yuhuai Wu, Łukasz Kuci, Piotr Miłoś, Konrad Czechowski, Tomasz Odrzygóźdź, Michał Zawalski, Michał Tyrolski, Damian Stachura, Piotr Piękos
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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 longerterm 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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2206.00702")
get_code_for_paper("2206.00702")
have("2206.00702")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2206.00702.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2206.00702)
Connect an agent — have() is free.