2 papers
cs.LG2025
What Matters in Hierarchical Search for Combinatorial Reasoning Problems?
MichaŠZawalski, Gracjan Góral, MichaŠTyrolski +5
Efficiently tackling combinatorial reasoning problems, particularly the notorious NP-hard tasks, remains a significant challenge for AI research. Recent efforts have sought to enha…
cs.AI2024
Fast and Precise: Adjusting Planning Horizon with Adaptive Subgoal Search
MichaÅ Zawalski, MichaÅ Tyrolski, Konrad Czechowski +6
Complex reasoning problems contain states that vary in the computational cost required to determine a good action plan. Taking advantage of this property, we propose Adaptive Subgo…