← Search

Konrad Czechowski

4 accepted papers

2023

Fast and Precise: Adjusting Planning Horizon with Adaptive Subgoal Search

ICLR 2023top-5%

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 di…

2022

Thor: Wielding Hammers to Integrate Language Models and Automated Theorem Provers

NeurIPS 2022accept

In theorem proving, the task of selecting useful premises from a large library to unlock the proof of a given conjecture is crucially important. This presents a challenge for all theorem provers, especially the ones based on language models, due to their relative inability to reason over huge volume…

Cited by 104SourcePDFScholar
2021

Subgoal Search For Complex Reasoning Tasks

NeurIPS 2021poster

Humans excel in solving complex reasoning tasks through a mental process of moving from one idea to a related one. Inspired by this, we propose Subgoal Search (kSubS) method. Its key component is a learned subgoal generator that produces a diversity of subgoals that are both achievable and closer to…

2020

Model Based Reinforcement Learning for Atari

ICLR 2020spotlight

Model-free reinforcement learning (RL) can be used to learn effective policies for complex tasks, such as Atari games, even from image observations. However, this typically requires very large amounts of interaction -- substantially more, in fact, than a human would need to learn the same games. How…

Cited by 1127SourcecodeScholar