Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.02103 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929372956459008 |
|---|---|
| author | Greshler, Nir Eli, David Ben Rabinovitz, Carmel Guetta, Gabi Gispan, Liran Zohar, Guy Tamar, Aviv |
| author_facet | Greshler, Nir Eli, David Ben Rabinovitz, Carmel Guetta, Gabi Gispan, Liran Zohar, Guy Tamar, Aviv |
| contents | The combination of Monte Carlo tree search and neural networks has revolutionized online planning. As neural network approximations are often imperfect, we ask whether uncertainty estimates about the network outputs could be used to improve planning. We develop a Bayesian planning approach that facilitates such uncertainty quantification, inspired by classical ideas from the meta-reasoning literature. We propose a Thompson sampling based algorithm for searching the tree of possible actions, for which we prove the first (to our knowledge) finite time Bayesian regret bound, and propose an efficient implementation for a restricted family of posterior distributions. In addition we propose a variant of the Bayes-UCB method applied to trees. Empirically, we demonstrate that on the ProcGen Maze and Leaper environments, when the uncertainty estimates are accurate but the neural network output is inaccurate, our Bayesian approach searches the tree much more effectively. In addition, we investigate whether popular uncertainty estimation methods are accurate enough to yield significant gains in planning. Our code is available at: https://github.com/nirgreshler/bayesian-online-planning. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_02103 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Bayesian Approach to Online Planning Greshler, Nir Eli, David Ben Rabinovitz, Carmel Guetta, Gabi Gispan, Liran Zohar, Guy Tamar, Aviv Artificial Intelligence The combination of Monte Carlo tree search and neural networks has revolutionized online planning. As neural network approximations are often imperfect, we ask whether uncertainty estimates about the network outputs could be used to improve planning. We develop a Bayesian planning approach that facilitates such uncertainty quantification, inspired by classical ideas from the meta-reasoning literature. We propose a Thompson sampling based algorithm for searching the tree of possible actions, for which we prove the first (to our knowledge) finite time Bayesian regret bound, and propose an efficient implementation for a restricted family of posterior distributions. In addition we propose a variant of the Bayes-UCB method applied to trees. Empirically, we demonstrate that on the ProcGen Maze and Leaper environments, when the uncertainty estimates are accurate but the neural network output is inaccurate, our Bayesian approach searches the tree much more effectively. In addition, we investigate whether popular uncertainty estimation methods are accurate enough to yield significant gains in planning. Our code is available at: https://github.com/nirgreshler/bayesian-online-planning. |
| title | A Bayesian Approach to Online Planning |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2406.02103 |