Probabilistic Artificial Intelligence
On the map: Deep reinforcement learning methods → RL theory and sample complexity
Abstract (arXiv)
Artificial intelligence commonly refers to the science and engineering of artificial systems that can carry out tasks generally associated with requiring aspects of human intelligence, such as playing games, translating languages, and driving cars. In recent years, there have been exciting advances in learning-based, data-driven approaches towards AI, and machine learning and deep learning have enabled computer systems to perceive the world in unprecedented ways. Reinforcement learning has enabled breakthroughs in complex games such as Go and challenging robotics tasks such as quadrupedal locomotion. A key aspect of intelligence is to not only make predictions, but reason about the uncertainty in these predictions, and to consider this uncertainty when making decisions. This is what this manuscript on "Probabilistic Artificial Intelligence" is about. The first part covers probabilistic approaches to machine learning. We discuss the differentiation between "epistemic" uncertainty due to lack of data and "aleatoric" uncertainty, which is irreducible and stems, e.g., from noisy observations and outcomes. We discuss concrete approaches towards probabilistic inference and modern approaches to efficient approximate inference. The second part of the manuscript is about taking uncertainty into account in sequential decision tasks. We consider active learning and Bayesian optimization -- approaches that collect data by proposing experiments that are informative for reducing the epistemic uncertainty. We then consider reinforcement learning and modern deep RL approaches that use neural network function approximation. We close by discussing modern approaches in model-based RL, which harness epistemic and aleatoric uncertainty to guide exploration, while also reasoning about safety.
Key facts. Cited by 6 papers in the map (data through 13 Oct 2026). Placed in RL theory and sample complexity, one of 15 directions in Deep reinforcement learning methods. First posted on arXiv 7 Feb 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2025: 2; 2026: 4.
6 papers.
- 2026On the Tightness and Computational Tractability of Higher-Dimensional Confidence Sequencescited by 1
- 2025A Relative Ignorability Framework for Decision-Relevant Observability in Control Theory and Reinforcement Learningcited by 0
- 2025Scalable Bayesian Monte Carlo: fast uncertainty estimation beyond deep ensemblescited by 0
- 2026BOBA: Dynamic Bayesian Optimization through Bayesian Active Inferencecited by 0
- 2026Deep Epistemic Value Functions for Optimistic Explorationcited by 0
- 2026When Has a Bayesian Neural Network Sampled Enough? Adaptive Inference Time with Statistical Guaranteescited by 0
- 2026When Has a Bayesian Neural Network Sampled Enough? Adaptive Inference Time with Statistical Guarantees8 Oct 2026
- 2026Deep Epistemic Value Functions for Optimistic Exploration28 Sep 2026
- 2026BOBA: Dynamic Bayesian Optimization through Bayesian Active Inference22 Sep 2026
- 2026On the Tightness and Computational Tractability of Higher-Dimensional Confidence Sequences21 Aug 2026
- 2025Scalable Bayesian Monte Carlo: fast uncertainty estimation beyond deep ensembles19 May 2025
- 2025A Relative Ignorability Framework for Decision-Relevant Observability in Control Theory and Reinforcement Learning10 Apr 2025