Probabilistic machine learning and artificial intelligence
The DOI matches its Crossref record; 104 of the 108 references it cites were found in a registry or an index.
Abstract
How can a machine learn from experience? Probabilistic modelling provides a framework for understanding what learning is, and has therefore emerged as one of the principal theoretical and practical approaches for designing machines that learn from data acquired through experience. The probabilistic framework, which describes how to represent and manipulate uncertainty about models and predictions, has a central role in scientific data analysis, machine learning, robotics, cognitive science and artificial intelligence. This Review provides an introduction to this framework, and discusses some of the state-of-the-art advances in the field, namely, probabilistic programming, Bayesian optimization, data compression and automatic model discovery.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Deriving from the Bayesian framework, GPR models have been widely applied to prognostic analysis as they are flexible, nonparametric and probabilistic [139].”
From Data-driven health estimation and lifetime prediction of lithium-ion batteries: A review (2019) · cites this paper as [139]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“To ameliorate this in GPR, one way is to minimize the negative log marginal likelihood [139].”
From Data-driven health estimation and lifetime prediction of lithium-ion batteries: A review (2019) · cites this paper as [139]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The performance of GPR is highly sensitive on the covariance function and the kernels should therefore be carefully selected to achieve high prediction accuracy [139].”
From Data-driven health estimation and lifetime prediction of lithium-ion batteries: A review (2019) · cites this paper as [139]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“These methods can be broadly classified into two categories: Bayesian approaches [40,90,106] and Frequentist, approaches [14,70,113]”
From Uncertainty as a Form of Transparency: Measuring, Communicating, and Using Uncertainty (2021) · cites this paper as [40]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155 · cited 1×
“recent advances using deep neural networks to solve challenging pattern recognition problems such as speech recognition [5], image classification [6, 7], and prediction of words in text [8], do not overtly represent the uncertainty in the structure or parameters of those neural networks.”
BackgroundA Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Gelman, A., Carlin, J. B., Stern, H. S., & Rubin, D. B. (2003) · doi:10.1201/9780429258480 · Cited by 27,276
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743 · cited 1×
“The HMM is a widely used probabilistic model for sequential and time-series data, which assumes the data were obtained by transitioning stochastically between a discrete number of hidden states 98 .”
MethodBook Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
Artificial intelligence: a modern approach
(1995) · Choice Reviews Online · doi:10.5860/choice.33-1577 · Cited by 21,974
Sequence to Sequence Learning with Neural Networks
Sutskever, I., Vinyals, O., & Le, Q. V. (2014) · arXiv · doi:10.48550/arxiv.1409.3215 · Cited by 17,766 · cited 1×
“The model could have a large number of parameters compared with the data set (for example, the neural network recently used to achieve translations of English and French sentences that approached the accuracy of state-of-the-art methods is a probabilistic model with 384 million parameters 29 ).”
MethodGaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
Artificial intelligence: A modern approach
Nilsson, N. J. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(96)00007-0 · Cited by 10,583
Research works printed but not linked: 14
- [8] Bengio, Y., Ducharme, R., Vincent, P. & Janvin, C. A neural probabilistic language model. The Journal of Machine Learning Research 3 , 1137-1155 (2003). -
- Hinton, G. E., McClelland, J. L. & Rumelhart, D. E. in Parallel Distributed Processing: Explorations in the Microstructure of Cognition: Foundations 77–109 (MIT Press, 1986).
- Goodman, N. D. & Stuhlmüller, A. The Design and Implementation of Probabilistic Programming Languages. Available at http://dippl.org (2015).
- Mansinghka, V., Kulkarni, T. D., Perov, Y. N. & Tenenbaum, J. Approximate Bayesian image interpretation using generative probabilistic graphics programs. In Proc. Advances in Neural Information Processing Systems 26 1520–1528 (2013).
- Minka, T. P., Winn, J. M., Guiver, J. P. & Knowles, D. A. Infer.NET 2.4. http://research.microsoft.com/infernet (Microsoft Research, 2010).
- Pfeffer, A. Figaro: An Object-Oriented Probabilistic Programming Language. Tech. Rep. (Charles River Analytics, 2009).
- Mansinghka, V., Selsam, D. & Perov, Y. Venture: a higher-order probabilistic programming platform with programmable inference. Preprint at http://arxiv.org/abs/1404.0099 (2014). · arXiv
- Li, L., Wu, Y. & Russell, S. J. SWIFT: Compiled Inference for Probabilistic Programs. Report No. UCB/EECS-2015–12 (Univ. California, Berkeley, 2015).
- Bergstra, J. et al. Theano: a CPU and GPU math expression compiler. In Proc. 9th Python in Science Conference http://conference.scipy.org/proceedings/scipy2010/ (2010).
- Poupart, P. in Encyclopedia of Machine Learning 90–93 (Springer, 2010).
- Grosse, R. B., Salakhutdinov, R. & Tenenbaum, J. B. Exploiting compositionality to explore a large space of model structures. In Proc. Conference on Uncertainty in Artificial Intelligence 306–315 (2012).
- Welling, M. et al. Bayesian inference with big data: a snapshot from a workshop. ISBA Bulletin 21, https://bayesian.org/sites/default/files/fm/bulletins/1412.pdf (2014).
- Bakker, B. & Heskes, T. Task clustering and gating for Bayesian multitask learning. J. Mach. Learn. Res. 4, 83–99 (2003).
- Hensman, J., Fusi, N. & Lawrence, N. D. Gaussian processes for big data. In Proc. Conference on Uncertainty in Artificial Intelligence 244 (UAI, 2013).
Cited by
Items 1,001–1,004 of 1,004
Modeling Uncertainty by Learning a Hierarchy of Deep Neural Connections
Rohekar, R. Y., Gurwicz, Y., Nisimov, S., & Novik, G. (2019) · arXiv · doi:10.48550/arxiv.1905.13195 · Cited by 10
“Representation of uncertainty is crucial for many domains, such as safety-critical applications, personalized medicine, and recommendation systems [6].”
BackgroundScaling behaviours of deep learning and linear algorithms for the prediction of stroke severity
(2023) · doi:10.1093/braincomms/fcae007 · Cited by 8
“62 Future work will be needed to complement our approach and look, exactly, into the derivation of interpretable, relevant lesion patterns.”
The benefit of the doubt: Uncertainty aware sensing for edge computing platforms
Qendro, L., Chauhan, J., Ramos, A. G. C. P., & Mascolo, C. (2021) · arXiv · doi:10.48550/arxiv.2102.05956 · Cited by 6
“Probability theory provides a framework for modelling uncertainty [23].”
BackgroundSalehi, R., Malik, A. W., Novotny, M. A., & Khan, S. U. (2026) · Scientific Reports · doi:10.1038/s41598-026-51033-9 · Cited by 1
Metadata
- Authors
- Ghahramani, Z.
- Venue
- Nature
- Published
- 2015-05-27
- Volume
- 521
- Issue
- 7553
- Pages
- 452-459
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W1494192115
- Cited by
- 1,995
- References
- 108
- Citations by year
- 2026: 166 · 2025: 231 · 2024: 228 · 2023: 206 · 2022: 217 · 2021: 265 · 2020: 235 · 2019: 210 · 2018: 102 · 2017: 84 · 2016: 39 · 2015: 11
- FWCI
- 2.97
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- www.springer.com/tdm (vor)
- Locations
- Nature (publishedVersion)
- PubMed (publishedVersion)
- Apollo (University of Cambridge) (acceptedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- Cambridge University Engineering Department Publications Database (submittedVersion)
- Funders
- Engineering and Physical Sciences Research Council (EP/I036575/1)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Modeling and Causal Inference
- Physical Sciences › Computer Science › Artificial Intelligence › Gaussian Processes and Bayesian Inference
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
- Keywords
- stochastic modeling, machine learning, artificial intelligence, uncertainty representation, probabilistic programming, Bayesian optimization, data compression, experiential learning
- MeSH terms
- Artificial Intelligence, Automation, Bayes Theorem, Models, Statistical, Statistics, Nonparametric, Uncertainty, Data Compression
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.