Planning, the process of evaluating the future consequences of actions, is typically formalized as search over a decision tree. This procedure increases expected rewards but is computationally expensive. Past attempts to understand how people mitigate the costs of planning have been guided by heuristics or the accumulation of prior experience, both of which are intractable in novel, high-complexity tasks. In this work, we propose a normative framework for optimizing the depth of tree search. Specifically, we model a metacognitive process via Bayesian inference to compute optimal planning depth. We show that our model makes sensible predictions over a range of parameters without relying on retrospection and that integrating past experiences ...
Planning is one of the fundamental problems of artificial intelligence. A classic planning problem ...
Artificial Intelligence (AI) is a long-studied and yet very active field of research. The list of th...
This paper proposes and investigates a novel way of combining machine learning and heuristic search ...
Evaluating the future consequences of actions is achievable by simulating a mental search tree into ...
Evaluating the future consequences of actions is achievable by simulating a mental search tree into ...
Many decisions involve choosing an uncertain course of action in deep and wide decision trees, as wh...
Abstract: In Reinforcement Learning, Unsupervised Skill Discovery tackles the learning of several po...
Behavioral and neural evidence reveal a prospective goal-directed decision process that relies on me...
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces...
Monte Carlo tree search (MCTS) is a sampling and simulation based technique for searching in large s...
Bayesian planning is a formally elegant approach to learning optimal behaviour under model uncertain...
Bayesian planning is a formally elegant approach to learning optimal behaviour under model uncertain...
Behavioral and neural evidence reveal a prospective goal-directed decision process that relies on me...
Online solvers for partially observable Markov decision processes have difficulty scaling to problem...
How do people plan ahead when searching for rewards? We investigate planning in a foraging task in w...
Planning is one of the fundamental problems of artificial intelligence. A classic planning problem ...
Artificial Intelligence (AI) is a long-studied and yet very active field of research. The list of th...
This paper proposes and investigates a novel way of combining machine learning and heuristic search ...
Evaluating the future consequences of actions is achievable by simulating a mental search tree into ...
Evaluating the future consequences of actions is achievable by simulating a mental search tree into ...
Many decisions involve choosing an uncertain course of action in deep and wide decision trees, as wh...
Abstract: In Reinforcement Learning, Unsupervised Skill Discovery tackles the learning of several po...
Behavioral and neural evidence reveal a prospective goal-directed decision process that relies on me...
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces...
Monte Carlo tree search (MCTS) is a sampling and simulation based technique for searching in large s...
Bayesian planning is a formally elegant approach to learning optimal behaviour under model uncertain...
Bayesian planning is a formally elegant approach to learning optimal behaviour under model uncertain...
Behavioral and neural evidence reveal a prospective goal-directed decision process that relies on me...
Online solvers for partially observable Markov decision processes have difficulty scaling to problem...
How do people plan ahead when searching for rewards? We investigate planning in a foraging task in w...
Planning is one of the fundamental problems of artificial intelligence. A classic planning problem ...
Artificial Intelligence (AI) is a long-studied and yet very active field of research. The list of th...
This paper proposes and investigates a novel way of combining machine learning and heuristic search ...