mlsanityData to 7 Oct 2026

Improving Active Learning with a Bayesian Representation of Epistemic Uncertainty

arXiv 2412.08225 ↗First posted 11 Dec 2024stat.ME cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

A popular strategy for active learning is to specifically target a reduction in epistemic uncertainty, since aleatoric uncertainty is often considered as being intrinsic to the system of interest and therefore not reducible. Yet, distinguishing these two types of uncertainty remains challenging and there is no single strategy that consistently outperforms the others. We propose to use a particular combination of probability and possibility theories, with the aim of using the latter to specifically represent epistemic uncertainty, and we show how this combination leads to new active learning strategies that have desirable properties. In order to demonstrate the efficiency of these strategies in non-trivial settings, we introduce the notion of a possibilistic Gaussian process (GP) and consider GP-based multiclass and binary classification problems, for which the proposed methods display a strong performance for both simulated and real datasets.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 6 of its 39 references that are in the map. First posted on arXiv 11 Dec 2024.

Builds on

6 of 39 references.

References · 6

  1. 2018GPyTorch: Blackbox Matrix-Matrix Gaussian Process Inference with GPU Accelerationcited by 603
  2. 2022Quantifying Aleatoric and Epistemic Uncertainty in Machine Learning: Are Conditional Entropy and Mutual Information Appropriate Measures?cited by 124
  3. 2023Prediction-Oriented Bayesian Active Learningcited by 60
  4. 2023Second-Order Uncertainty Quantification: A Distance-Based Approachcited by 35
  5. 2021Diversity Enhanced Active Learning with Strictly Proper Scoring Rulescited by 22
  6. 2018Parameter estimation with a class of outer probability measurescited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 2.

4 papers.