Online Platt Scaling with Calibeating
Not on the map. Why?
Abstract (arXiv)
We present an online post-hoc calibration method, called Online Platt Scaling (OPS), which combines the Platt scaling technique with online logistic regression. We demonstrate that OPS smoothly adapts between i.i.d. and non-i.i.d. settings with distribution drift. Further, in scenarios where the best Platt scaling model is itself miscalibrated, we enhance OPS by incorporating a recently developed technique called calibeating to make it more robust. Theoretically, our resulting OPS+calibeating method is guaranteed to be calibrated for adversarial outcome sequences. Empirically, it is effective on a range of synthetic and real-world datasets, with and without distribution drifts, achieving superior performance without hyperparameter tuning. Finally, we extend all OPS ideas to the beta scaling method.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 16 of its 44 references that are in the map. First posted on arXiv 28 Apr 2023.
Builds on
16 of 44 references.
References · 16
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2019Introduction to Online Convex Optimizationcited by 803
- 2019Verified Uncertainty Calibrationcited by 309
- 2020Mix-n-Match: Ensemble and Compositional Methods for Uncertainty Calibration in Deep Learningcited by 190
- 2020Mitigating Bias in Calibration Error Estimationcited by 101
- 2019Calibration tests in multi-class classification: A unifying frameworkcited by 79
- 2020Distribution-free binary classification: prediction sets, confidence intervals and calibrationcited by 79
- 2021Top-label calibration and multiclass-to-binary reductionscited by 46
- 2021Distribution-free calibration guarantees for histogram binning without sample splittingcited by 45
- 2018Logistic Regression: The Importance of Being Impropercited by 41
- 2022Forecast Hedging and Calibrationcited by 22
- 2013Approachability, Regret and Calibration; implications and equivalencescited by 19
4 more
- 2020Efficient improper learning for online logistic regressioncited by 16
- 2022"Calibeating": Beating Forecasters at Their Own Gamecited by 14
- 2021Mixability made efficient: Fast online multiclass logistic regressioncited by 12
- 2022Faster online calibration without randomization: interval forecasts and the power of two choicescited by 4
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 2; 2026: 3.
8 papers.
- 2023Minimum-Risk Recalibration of Classifierscited by 10
- 2024Orthogonal Causal Calibrationcited by 6
- 2026Calibeating Made Simplecited by 5
- 2023Parity Calibrationcited by 2
- 2025Optimal and Provable Calibration in High-Dimensional Binary Classification: Angular Calibration and Platt Scalingcited by 2
- 2026Learning to Decide with AI Assistance under Human-Alignmentcited by 1
- 2025Protected Probabilistic Classification Librarycited by 0
- 2026Calibeating for general proper losses: A Bregman divergence approachcited by 0
- 2026Calibeating for general proper losses: A Bregman divergence approach17 May 2026
- 2026Learning to Decide with AI Assistance under Human-Alignment12 May 2026
- 2026Calibeating Made Simple23 Mar 2026
- 2025Protected Probabilistic Classification Library14 Sep 2025
- 2025Optimal and Provable Calibration in High-Dimensional Binary Classification: Angular Calibration and Platt Scaling21 Feb 2025
- 2024Orthogonal Causal Calibration4 Jun 2024
- 2023Parity Calibration29 May 2023
- 2023Minimum-Risk Recalibration of Classifiers18 May 2023