What Matters in Hierarchical Search for Combinatorial Reasoning Problems?

1 code implementation • 5 Jun 2024 • Michał Zawalski, Gracjan Góral, Michał Tyrolski, Emilia Wiśnios, Franciszek Budrowski, Łukasz Kuciński, Piotr Miłoś

Efficiently tackling combinatorial reasoning problems, particularly the notorious NP-hard tasks, remains a significant challenge for AI research.

Fast and Precise: Adjusting Planning Horizon with Adaptive Subgoal Search

1 code implementation • 1 Jun 2022 • Michał Zawalski, Michał Tyrolski, Konrad Czechowski, Tomasz Odrzygóźdź, Damian Stachura, Piotr Piękos, Yuhuai Wu, Łukasz Kuciński, Piotr Miłoś

Complex reasoning problems contain states that vary in the computational cost required to determine a good action plan.

Rubik's Cube

Off-Policy Correction For Multi-Agent Reinforcement Learning

1 code implementation • 22 Nov 2021 • Michał Zawalski, Błażej Osiński, Henryk Michalewski, Piotr Miłoś

The key advantage of our algorithm is its high scalability in a multi-worker setting.

Multi-agent Reinforcement Learning reinforcement-learning +2

Subgoal Search For Complex Reasoning Tasks

1 code implementation • NeurIPS 2021 • Konrad Czechowski, Tomasz Odrzygóźdź, Marek Zbysiński, Michał Zawalski, Krzysztof Olejnik, Yuhuai Wu, Łukasz Kuciński, Piotr Miłoś

In this paper, we implement kSubS using a transformer-based subgoal module coupled with the classical best-first search framework.

Rubik's Cube