mlsanityData to 14 Oct 2026

Scoring Rules and Calibration for Imprecise Probabilities

arXiv 2410.23001 ↗First posted 30 Oct 2024cs.LG math.ST stat.THcited by 10

Not on the map. Why?

Abstract (arXiv)

What does it mean to say that, for example, the probability for rain tomorrow is between 20% and 30%? The theory for the evaluation of precise probabilistic forecasts is well-developed and is grounded in the key concepts of proper scoring rules and calibration. For the case of imprecise probabilistic forecasts (sets of probabilities), such theory is still lacking. In this work, we therefore generalize proper scoring rules and calibration to the imprecise case. We develop these concepts as relative to data models and decision problems. As a consequence, the imprecision is embedded in a clear context. We establish a close link to the paradigm of (group) distributional robustness and in doing so provide new insights for it. We argue that proper scoring rules and calibration serve two distinct goals, which are aligned in the precise case, but intriguingly are not necessarily aligned in the imprecise case. The concept of decision-theoretic entropy plays a key role for both goals. Finally, we demonstrate the theoretical insights in machine learning practice, in particular we illustrate subtle pitfalls relating to the choice of loss function in distributional robustness.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 23 of its 86 references that are in the map. First posted on arXiv 30 Oct 2024.

Builds on

23 of 86 references.

References · 23

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  2. 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
  3. 2019Aleatoric and Epistemic Uncertainty in Machine Learning: An Introduction to Concepts and Methodscited by 913
  4. 2021Retiring Adult: New Datasets for Fair Machine Learningcited by 449
  5. 2019Learning Loss for Active Learningcited by 336
  6. 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 335
  7. 2019Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learningcited by 170
  8. 2021Calibrating Predictions to Decisions: A Novel Approach to Multi-Class Calibrationcited by 79
  9. 2023U-Calibration: Forecasting for an Unknown Agentcited by 46
  10. 2024CreINNs: Credal-Set Interval Neural Networks for Uncertainty Estimation in Classification Taskscited by 26
  11. 2021Ensemble-based Uncertainty Quantification: Bayesian versus Credal Inferencecited by 16
  12. 2023Distributionally Robust Post-hoc Classifiers under Prior Shiftscited by 16
11 more
  1. 2024Domain Generalisation via Imprecise Learningcited by 14
  2. 2024Pretrained Visual Uncertaintiescited by 10
  3. 2022Risk Measures and Upper Probabilities: Coherence and Stratificationcited by 9
  4. 2023On the Richness of Calibrationcited by 9
  5. 2020Right Decisions from Wrong Predictions: A Mechanism Design Alternative to Individual Calibrationcited by 7
  6. 2022The Geometry and Calculus of Lossescited by 7
  7. 2018Constant Regret, Generalized Mixability, and Mirror Descentcited by 5
  8. 2020Continuity of Generalized Entropy and Statistical Learningcited by 3
  9. 2022Information Processing Equalities and the Information-Risk Bridgecited by 3
  10. 2023Insights From Insurance for Fair Machine Learningcited by 2
  11. 2024Evaluation Metrics as Averaged Outcomes of Fair Gamblescited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 6; 2026: 3.

10 papers.