mlsanityData to 7 Oct 2026

Calibrating sufficiently

arXiv 2105.07283 ↗First posted 15 May 2021stat.ML cs.LG math.STcited by 10

Not on the map. Why?

Abstract (arXiv)

When probabilistic classifiers are trained and calibrated, the so-called grouping loss component of the calibration loss can easily be overlooked. Grouping loss refers to the gap between observable information and information actually exploited in the calibration exercise. We investigate the relation between grouping loss and the concept of sufficiency, identifying comonotonicity as a useful criterion for sufficiency. We revisit the probing reduction approach of Langford & Zadrozny (2005) and find that it produces an estimator of probabilistic classifiers that reduces grouping loss. Finally, we discuss Brier curves as tools to support training and 'sufficient' calibration of probabilistic classifiers.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 6 of its 68 references that are in the map. First posted on arXiv 15 May 2021.

Builds on

6 of 68 references.

References · 6

  1. 2019Evaluating model calibration in classificationcited by 165
  2. 2020Mitigating Bias in Calibration Error Estimationcited by 100
  3. 2015Of Quantiles and Expectiles: Consistent Scoring Functions, Choquet Representations, and Forecast Rankingscited by 28
  4. 2018A Generalized Neyman-Pearson Criterion for Optimal Domain Adaptationcited by 22
  5. 2018Generic Conditions for Forecast Dominancecited by 13
  6. 2018A plug-in approach to maximising precision at the top and recall at the topcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 2; 2023: 3; 2024: 0; 2025: 2; 2026: 2.

10 papers.