Optimal and Provable Calibration in High-Dimensional Binary Classification: Angular Calibration and Platt Scaling
Yufan Li, Pragya Sur

TL;DR
This paper introduces an angular calibration method for high-dimensional binary classifiers that is provably well-calibrated and Bregman-optimal, and shows that classical Platt scaling can also achieve these properties under certain conditions.
Contribution
It presents the first calibration strategy that guarantees both calibration and optimality in high-dimensional settings, using angular interpolation and Bregman divergence minimization.
Findings
Angular calibration is well-calibrated in high dimensions.
The estimator of the angle between weights is consistent.
Classical Platt scaling converges to the Bregman-optimal solution under certain conditions.
Abstract
We study the fundamental problem of calibrating a linear binary classifier of the form , where the feature vector is Gaussian, is a link function, and is an estimator of the true linear weight . By interpolating with a noninformative , we construct a well-calibrated predictor whose interpolation weight depends on the angle between the estimator and the true linear weight . We establish that this angular calibration approach is provably well-calibrated in a high-dimensional regime where the number of samples and features both diverge, at a comparable rate. The angle can be consistently estimated. Furthermore, the resulting predictor is uniquely , minimizing the Bregman divergence to the true label…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
