Cited by 1,834Adversarial Robustness in Machine LearningGaussian Processes and Bayesian InferenceBayesian Modeling and Causal Inference

Aleatoric and epistemic uncertainty in machine learning: an introduction to concepts and methods

Open access
Hüllermeier, Eyke, Waegeman, Willem·2021·Machine Learning

Abstract

The notion of uncertainty is of major importance in machine learning and constitutes a key element of machine learning methodology. In line with the statistical tradition, uncertainty has long been perceived as almost synonymous with standard probability and probabilistic predictions. Yet, due to the steadily increasing relevance of machine learning for practical applications and related issues such as safety requirements, new problems and challenges have recently been identified by machine learning scholars, and these problems may call for new methodological developments. In particular, this includes the importance of distinguishing between (at least) two different types of uncertainty, often referred to as aleatoric and epistemic . In this paper, we provide an introduction to the topic of uncertainty in machine learning as well as an overview of attempts so far at handling uncertainty in general and formalizing this distinction in particular.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/s10994-021-05946-3

Cites

109 of 109 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • Predictive multiplicity is high when all predictions are close to τ but some lie above and others below (high aleatoric uncertainty), or when predictions are widely spread with some far above and others far below τ (high epistemic uncertainty).

    “Predictive multiplicity, and thus the prospects for successful epistemic contestability, is high in two scenarios: (1) when all predictions are close to τ but some lie above and others below, corresponding to high aleatoric uncertainty; and (2) when predictions are widely spread, with some far above and others far below τ , corresponding to high epistemic uncertainty (Hüllermeier and Waegeman 2021”

    From Explainable AI Isn't Enough! Rethinking Algorithmic Contestability (2026) · cites this paper as Hüllermeier and Waegeman 2021

    Section 4.7.2 (page unavailable) links predictions near the 1/2 class boundary to aleatoric uncertainty and strongly opposed predictions from plausible hypotheses to epistemic uncertainty. It also says full aleatoric uncertainty involves agreement at 1/2, not predictions falling on both sides of a threshold. The paper does not establish the claimed two-scenario rule for predictive multiplicity or its implications for epistemic contestability. (LLM, conf=0.84)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

2 of the 111 references couldn’t be matched to a known paper.

Research works printed but not linked: 14

  1. Bazargami, M., & Mac-Namee, B. (2019). The elliptical basis function data descriptor network: A one- class classification approach for anomaly detection. In European conference on machine learning and knowledge discovery in databases.
  2. Depeweg, S., Hernandez-Lobato, J., Doshi-Velez, F., & Udluft, S. (2018). Decomposition of uncertainty in Bayesian deep learning for efficient and risk-sensitive learning. In Proceedings of ICML, 35th inter- national conference on machine learning, Stockholm, Sweden.
  3. Dubois, D., & Prade, H. (1988). Possibility theory. Berlin: Plenum Press.
  4. Hartley, R. (1928). Transmission of information. Bell Labs Technical Journal, 7(3), 535-563.
  5. Kendall, A., & Gal, Y. (2017). What uncertainties do we need in Bayesian deep learning for computer vision? In Proceedings of NIPS, advances in neural information processing systems, pp. 5574-5584.
  6. Kolmogorov, A. (1965). Three approaches to the quantitative definition of information. Problems of Infor- mation Transmission, 1(1), 1-7.
  7. Maau, D. D., Cozman, F., Conaty, D., & de Campos, C. P. (2017). Credal sum-product networks. In PMLR: Proceedings of machine learning Research (ISIPTA 2017), vol 62, pp. 205-216.
  8. Matheron, G. (1975). Random sets and integral geometry. New York: Wiley.
  9. Mobiny, A., Nguyen, H., Moulik, S., Garg, N., & Wu, C. (2017). DropConnect is effective in modeling uncertainty of Bayesian networks. CoRR. arXiv :abs/1906.04569 .
  10. Neal, R. (2012). Bayesian learning for neural networks (p. 118). Berlin: Springer.
  11. Owhadi, H., Sullivan, T., McKerns, M., Ortiz, M., & Scovel, C. (2012). Optimal uncertainty quantifica- tion. CoRR. (arXiv :abs/1009.0679.v3).
  12. Platt, J. (1999). Probabilistic outputs for support vector machines and comparison to regularized likeli- hood methods. In A. Smola, P. Bartlett, B. Schoelkopf, & D. Schuurmans (Eds.), Advances in large margin classifiers (pp. 61-74). Cambridge, MA: MIT Press.
  13. Rangwala, H., & Naik, A. (2017). Large scale hierarchical classification: Foundations, algorithms and applications. In The European conference on machine learning and principles and practice of knowledge discovery in databases.
  14. Sugeno, M. (1974). Theory of fuzzy integrals and its application. PhD thesis, Tokyo Institute of Technology.

Cited by

Sorted by citations

Authors
Hüllermeier, E., & Waegeman, W.
Affiliations
  • Paderborn University (DE)
  • Ghent University (BE)
Corresponding author
Hüllermeier, Eyke
Venue
Machine Learning
Published
2021-03
Volume
110
Issue
3
Pages
457-506
ISSN
  • 0885-6125 (ISSN-L)
  • 1573-0565
OpenAlex
W3014596384
Cited by
1,834
References
111
Citations by year
2026: 426 · 2025: 445 · 2024: 373 · 2023: 304 · 2022: 181 · 2021: 88 · 2020: 16
FWCI
83.57
Type
journal article
Language
en
Open access
Locations
  • Machine Learning (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • Ghent University Academic Bibliography (Ghent University) (submittedVersion, cc-by)
  • Open access LMU (Ludwid Maxmilian's Universitat Munchen) (submittedVersion, cc-by)
  • arXiv (Cornell University)
Funders
Projekt DEAL
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
  • Physical Sciences › Computer Science › Artificial Intelligence › Gaussian Processes and Bayesian Inference
  • Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Modeling and Causal Inference
Keywords
aleatoric uncertainty, epistemic uncertainty, uncertainty quantification, probabilistic forecasting, safety-critical machine learning

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