REVIEW 2 major objections 3 minor 16 references
Probabilistic Artificial Intelligence
T0 review · 2 major / 3 minor · reviewed 2026-08-08 · deepseek-v4-flash
Pith's one-line read Probabilistic inference — updating beliefs under Bayes' rule — is presented as the single framework behind prediction, learning, and sequential decision-making.
desk verdict A solid graduate textbook that consolidates probabilistic ML and sequential decision-making, but not a research contribution, and the strong unifying claim about effective decisions outruns the book's own warnings about overconfident approximations. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the posterior distribution $p(\theta \mid y_{1:n}) \propto p(y_{1:n} \mid \theta)\,p(\theta)$ and the recursive update that turns today's posterior into tomorrow's prior. Around this, the manuscript organizes two identities: the law of total variance, which splits predictive variance into aleatoric and epistemic parts, and the Gaussian closedness properties, under which marginals, conditionals, and affine transformations stay Gaussian, making exact inference tractable in linear-Gaussian models, Kalman filters, and Gaussian processes. When exact inference is intractable, variational inference and Markov chain Monte Carlo supply the approximations; when decisions are sequential, expected-utility maximization and the Bellman equations carry the same posterior logic into planning and reinforcement learning.
What would settle it
Take a misspecified model — fit Bayesian linear regression with a Gaussian prior to data generated by a nonlinear function — and compute the empirical coverage of the 95% predictive credible sets on a held-out test set. If the coverage is systematically far below 95% for modest sample sizes, the claim that posterior uncertainty is reliable guidance for decisions fails in exactly the finite-sample regime the book cares about.
Extended reading notes
Core claim
The central claim is that probabilistic inference — updating a prior belief to a posterior via Bayes' rule — is the natural extension of logical reasoning from certainty to uncertainty, and that this single operation organizes both learning and decision-making. In the learning half, the manuscript shows that linear regression, Kalman filtering, Gaussian processes, and Bayesian neural networks are all instances of posterior inference, with the law of total variance separating epistemic from aleatoric uncertainty. In the decision half, it shows that active learning, Bayesian optimization, and reinforcement learning can be viewed as policies that use posterior uncertainty to explore, with the optimal decision rule maximizing expected utility. The book's stated 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.
Load-bearing premise
The framework works only if the subjective Bayesian interpretation of probability is accepted and if the asymptotic guarantees of posterior consistency and Bernstein-von Mises behavior carry over to the finite-sample settings where the book's advice is actually applied.
Editorial extensions
If this is right
- In linear-Gaussian models the posterior is closed-form, so Bayesian linear regression, Kalman filtering, and Gaussian process regression share one inference engine with $O(n^3)$ or $O(nd^2)$ costs.
- Epistemic uncertainty can be actively reduced by querying points that maximize mutual information, which grounds active learning and Bayesian optimization in the same posterior-update story.
- Reinforcement-learning agents that maintain posterior distributions over dynamics can separate exploration driven by epistemic uncertainty from exploitation, and can reason about safety by avoiding actions whose epistemic uncertainty is high.
- The asymptotic results on posterior consistency mean that with enough data the prior is overwhelmed by observations, so the prior matters mainly in the small-data, limited-computation regime.
- Because the posterior distribution can be updated recursively, the same inference engine supports online learning and continual learning without storing all past data.
Reading between the lines
- If the thesis holds, uncertainty calibration should become a first-class evaluation criterion in deployed machine-learning systems; one testable extension is comparing the calibration of Laplace, variational, and MCMC posteriors on the same deep-network benchmark.
- The framework stops at the posterior, but its logic could be extended to large language models by equipping them with explicit posteriors over context-conditional responses; no such extension is made in the manuscript.
- A reader could probe the framework's reach by asking whether non-Bayesian tools such as conformal prediction or frequentist confidence intervals can be re-derived as approximations of posterior credible sets; the manuscript does not address that question.
- The book's decision-theoretic rule assumes the reward function is known and fixed; extending it to learned or misspecified rewards would test whether the probabilistic framework remains the right organizing principle in more realistic interactive settings.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript is a graduate-level textbook based on an ETH Zürich course, presenting probabilistic inference as the central organizing principle of modern AI. Part I develops the probabilistic toolkit—Bayesian linear regression, Kalman filtering, Gaussian processes, variational inference, Markov chain Monte Carlo, and deep learning—with an emphasis on distinguishing epistemic and aleatoric uncertainty. Part II applies this toolkit to sequential decision-making: active learning, Bayesian optimization, Markov decision processes, and reinforcement learning, exploiting uncertainty for exploration and safety. The book includes many exercises with solutions, appendices, and an extensive bibliography.
Significance. The manuscript is a well-structured synthetic presentation of a large body of standard material. Its strengths are its coherent narrative, the consistent use of a small set of mathematical tools (Bayes' rule, Gaussian identities, KL divergence, information theory), the explicit treatment of both exact and approximate inference, and the inclusion of worked examples and exercises. As a reference or course text, it could be valuable for graduate students and practitioners seeking a unified view of probabilistic machine learning and sequential decision-making. The central claim is not a new theorem but a pedagogical thesis: that uncertainty quantification is essential to intelligence and that probabilistic inference is the right formal framework for it. The book is careful to flag limitations of individual approximation methods, but, as elaborated below, it does not adequately connect those caveats to the decision-making methods presented in Part II.
major comments (2)
- [Preface; §5.1; §5.4.5; §8.2; §9.3; §13.3] The Preface states that a key aspect of intelligence is to reason about uncertainty and to consider it when making decisions, and Part II presents active learning (§8.2), Bayesian optimization (§9.3), and model-based RL (§13.3) as methods that use epistemic uncertainty to guide data collection and exploration. However, the book's own account of approximate inference in Part I shows that the uncertainty estimates supplied to these methods can be seriously overconfident: §5.1 calls the Laplace approximation 'extremely overconfident' when the posterior is non-Gaussian, and §5.4.5 states that reverse-KL minimization tends to underestimate variance and leads to 'an overconfident prediction' (Figure 5.9). No conditions or diagnostics are provided under which these approximate posteriors are calibrated enough for the acquisition functions and exploration bonuses in Part II to be reliable. As a result, the book does not substantiate the 'effective' part of its central claim: a miscalibrated posterior can produce confidently wrong exploration decisions. This is a missing bridge between the intractability/approximation caveats of Part I and the downstream use of uncertainty in Part II, and it should be addressed, at minimum, with an explicit discussion of the assumptions required by the decision-making methods and pointers to calibration checks or finite-sample guarantees.
- [§1.3.3; §8.1; §9.1] Section 1.3.3 justifies Bayesian inference by appealing to Doob's consistency theorem and the Bernstein-von Mises theorem, both asymptotic results. The second part of the book, however, is concerned precisely with the small-data regime: active learning and Bayesian optimization are introduced in §8.1 and §9.1 as methods that collect data because the current posterior is insufficiently informed. In this regime the asymptotic theorems do not apply, and the manuscript supplies no finite-sample statements about the quality of the posterior, such as coverage of credible sets, calibration of predictive probabilities, or contraction-rate bounds. The gap is material for the book's thesis because the decision rules in Part II inherit whatever unreliability the posterior or its approximation carries. I recommend adding a treatment of finite-sample calibration or a discussion of when the asymptotic results are expected to be a good approximation.
minor comments (3)
- [§5.4.1] In the proof of Theorem 5.6, the line 'log(uv) = log v + log v' contains a typo; it should read 'log(uv) = log u + log v'.
- [§4.3.4] Definition 4.6 defines the RKHS as the set of finite kernel sums, but this set is not complete; the usual definition takes its completion. The representer theorem is then stated over 'H_k(X)' as if it were the full RKHS, which may confuse readers not already familiar with the construction.
- [Remark 1.11] The example 'X ⊥ X | X' is logically correct but could be confusing; using a non-degenerate example such as X and Y with a common cause Z might make the point that conditional independence does not imply independence more accessible.
Circularity Check
No significant circularity: the manuscript is a self-contained textbook exposition that derives established results from first principles.
full rationale
The manuscript makes no original predictive claim that could reduce to its inputs. It is a pedagogical monograph: Bayes' rule is derived from the definition of conditional probability and the product rule; Bayesian linear regression, Kalman filtering, Gaussian processes, variational inference, and MCMC are all derived from stated probabilistic assumptions with standard analytical arguments. External citations (e.g., Doob's consistency theorem, Bernstein-von Mises, Bochner's theorem, Rahimi et al.'s Fourier feature convergence, Williams and Rasmussen) are genuine independent mathematical or published results, not author-self-citations carrying the argument. There are no fitted parameters that are later renamed as predictions, no uniqueness theorem imported from the authors' own prior work, and no ansatz smuggled in via a self-citation. Internal cross-references such as '? Problem 5.7' or '? Problem 3.2' are exercises that ask the reader to verify stated equivalences, not circular support. The Preface's unifying thesis is an expository framing rather than a derived theorem; the reader's skeptical concern about overconfident approximate posteriors is a correctness/coverage gap in the presented material, not a circularity. Accordingly, the appropriate finding is no significant circularity, scored 0.
Assumptions & free parameters
assumptions (6)
- standard math Kolmogorov axioms of probability
- domain assumption Maximum entropy principle
- domain assumption Doob's consistency theorem and Bernstein-von Mises theorem
- standard math Bochner's theorem
- standard math Representer theorem
- domain assumption Markov property for Kalman filters and MDPs
Cite this review
Pith. "Pith review of Probabilistic Artificial Intelligence." pith.science (2026). https://pith.science/paper/FQV3COAG
@misc{pith2026250205244,
author = {Pith},
title = {Pith review of: Probabilistic Artificial Intelligence},
year = {2026},
howpublished = {\url{https://pith.science/paper/FQV3COAG}},
note = {Machine review of arXiv:2502.05244}
}
read the original abstract
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.
Reference graph
Works this paper leans on
-
[8]
Reinforcement learning and control as probabilistic inference: Tutorial and review
Sergey Levine. Reinforcement learning and control as probabilistic inference: Tutorial and review. arXiv preprint arXiv:1805.00909,
-
[10]
A detailed treatment of doob’s theorem
Jeffrey W Miller. A detailed treatment of doob’s theorem. arXiv preprint arXiv:1801.03122,
-
[13]
An overview of gradient descent optimization algorithms
Sebastian Ruder. An overview of gradient descent optimization algorithms. arXiv preprint arXiv:1609.04747,
-
[14]
Proximal policy optimization algo- rithms
John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy optimization algo- rithms. arXiv preprint arXiv:1707.06347,
-
[15]
Deepseekmath: Pushing the limits of mathematical reasoning in open language models
Zhihong Shao, Peiyi Wang, Qihao Zhu, Runxin Xu, Junxiao Song, Xiao Bi, Haowei Zhang, Mingchuan Zhang, YK Li, Y Wu, et al. Deepseekmath: Pushing the limits of mathematical reasoning in open language models. arXiv preprint arXiv:2402.03300,
-
[16]
Mastering chess and shogi by self-play with a general reinforce- ment learning algorithm
David Silver, Thomas Hubert, Julian Schrittwieser, Ioannis Antonoglou, Matthew Lai, Arthur Guez, Marc Lanctot, Lau- rent Sifre, Dharshan Kumaran, Thore Graepel, et al. Mastering chess and shogi by self-play with a general reinforce- ment learning algorithm. arXiv preprint arXiv:1712.01815,
-
[2008]
Multi-goal reinforcement learning: Challenging robotics environments and request for research
Matthias Plappert, Marcin Andrychowicz, Alex Ray, Bob McGrew, Bowen Baker, Glenn Powell, Jonas Schneider, Josh Tobin, Maciek Chociej, Peter Welinder, et al. Multi-goal reinforcement learning: Challenging robotics environments and request for research. arXiv preprint arXiv:1802.09464,
-
[2009]
Ogbench: Benchmarking offline goal-conditioned rl
Seohong Park, Kevin Frans, Benjamin Eysenbach, and Sergey Levine. Ogbench: Benchmarking offline goal-conditioned rl. arXiv preprint arXiv:2410.20092,
Show all 16 references
-
[2013]
Open problems and fundamental limitations of reinforcement learning from human feedback
Stephen Casper, Xander Davies, Claudia Shi, Thomas Krendl Gilbert, Jérémy Scheurer, Javier Rando, Rachel Freedman, Tomasz Korbak, David Lindner, Pedro Freire, et al. Open problems and fundamental limitations of reinforcement learning from human feedback. arXiv preprint arXiv:2...
-
[2015]
Improving neural networks by preventing co-adaptation of feature detectors
Geoffrey E Hinton, Nitish Srivastava, Alex Krizhevsky, Ilya Sutskever, and Ruslan R Salakhutdinov. Improving neural networks by preventing co-adaptation of feature detectors. arXiv preprint arXiv:1207.0580,
-
[2016]
Humans are not boltzmann distributions: Challenges and opportunities for modelling human feedback and interaction in reinforcement learning
David Lindner and Mennatallah El-Assady. Humans are not boltzmann distributions: Challenges and opportunities for modelling human feedback and interaction in reinforcement learning. arXiv preprint arXiv:2206.13316,
-
[2017]
Deepseek-r 1: Incentivizing reasoning capability in llms via reinforcement learning
Daya Guo, Dejian Yang, Haowei Zhang, Junxiao Song, Ruoyu Zhang, Runxin Xu, Qihao Zhu, Shirong Ma, Peiyi Wang, Xiao Bi, et al. Deepseek-r 1: Incentivizing reasoning capability in llms via reinforcement learning. arXiv preprint arXiv:2501.12948,
-
[2020]
Application of the theory of martingales
Joseph Leo Doob. Application of the theory of martingales. Actes du Colloque International Le Calcul des Probabilités et ses applications (Lyon, 28 Juin – 3 Juillet, 1948),
1948
-
[2022]
Active fine-tuning of generalist policies
Marco Bagatella, Jonas Hübotter, Georg Martius, and Andreas Krause. Active fine-tuning of generalist policies. arXiv preprint arXiv:2410.05026,
-
[2024]
Diffusions hypercontractives
Dominique Bakry and Michel Émery. Diffusions hypercontractives. In Séminaire de Probabilités XIX 1983/84: Proceedings. Springer,
1983
-
[2025]
Soft actor-critic: Off-policy maximum entropy deep reinforcement learning with a stochastic actor
Tuomas Haarnoja, Aurick Zhou, Pieter Abbeel, and Sergey Levine. Soft actor-critic: Off-policy maximum entropy deep reinforcement learning with a stochastic actor. In ICML, 2018a. Tuomas Haarnoja, Aurick Zhou, Kristian Hartikainen, George Tucker, Sehoon Ha, Jie Tan, Vikash Kuma...
Reviewed August 8, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.