Planning to Be Surprised: Optimal Bayesian Exploration in Dynamic Environments
Yi Sun, Faustino Gomez, Juergen Schmidhuber

TL;DR
This paper derives an optimal Bayesian exploration strategy for AGI in dynamic environments, enabling more effective discovery of unknown worlds.
Contribution
It introduces a theoretical framework for optimal exploration in dynamic settings, filling a gap in existing exploration strategies.
Findings
Proves the existence of an optimal exploration policy for certain environments
Provides a mathematical derivation of the exploration strategy
Enhances understanding of exploration in AGI development
Abstract
To maximize its success, an AGI typically needs to explore its initially unknown world. Is there an optimal way of doing so? Here we derive an affirmative answer for a broad class of environments.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Advanced Bandit Algorithms Research · Computability, Logic, AI Algorithms
