mlsanityData to 14 Oct 2026

Reconciling Individual Probability Forecasts

arXiv 2209.01687 ↗First posted 4 Sep 2022cs.LG cs.DS math.STcited by 14

Not on the map. Why?

Abstract (arXiv)

Individual probabilities refer to the probabilities of outcomes that are realized only once: the probability that it will rain tomorrow, the probability that Alice will die within the next 12 months, the probability that Bob will be arrested for a violent crime in the next 18 months, etc. Individual probabilities are fundamentally unknowable. Nevertheless, we show that two parties who agree on the data -- or on how to sample from a data distribution -- cannot agree to disagree on how to model individual probabilities. This is because any two models of individual probabilities that substantially disagree can together be used to empirically falsify and improve at least one of the two models. This can be efficiently iterated in a process of "reconciliation" that results in models that both parties agree are superior to the models they started with, and which themselves (almost) agree on the forecasts of individual probabilities (almost) everywhere. We conclude that although individual probabilities are unknowable, they are contestable via a computationally and data efficient process that must lead to agreement. Thus we cannot find ourselves in a situation in which we have two equally accurate and unimprovable models that disagree substantially in their predictions -- providing an answer to what is sometimes called the predictive or model multiplicity problem.

Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). Builds on 11 of its 43 references that are in the map. First posted on arXiv 4 Sep 2022.

Builds on

11 of 43 references.

References · 11

  1. 2020Underspecification Presents Challenges for Credibility in Modern Machine Learningcited by 496
  2. 2019Predictive Multiplicity in Classificationcited by 166
  3. 2015Algorithmic Stability for Adaptive Data Analysiscited by 88
  4. 2015Generalization in Adaptive Data Analysis and Holdout Reusecited by 83
  5. 2020Outcome Indistinguishabilitycited by 75
  6. 2022Practical Adversarial Multivalid Conformal Predictioncited by 65
  7. 2020Moment Multicalibration for Uncertainty Estimationcited by 63
  8. 2021Online Multivalid Learning: Means, Moments, and Prediction Intervalscited by 49
  9. 2019A New Analysis of Differential Privacy's Generalization Guaranteescited by 36
  10. 2022An Algorithmic Framework for Bias Bountiescited by 21
  11. 2019Tracking and Improving Information in the Service of Fairnesscited by 8

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 4; 2024: 4; 2025: 5; 2026: 1.

14 papers.

Sort:

By area: