- Rating
- 3
- Confidence
- 1
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper studies minimax rates for online calibration. The main contribution is a two-test lower-bound principle, which establishes matching lower bounds for smooth calibration and calibration distance, closing the gap between the previously known lower and upper bounds. The paper also studies online kernel calibration and shows that different kernel geometries can lead to rates of , , or .
Critical strengths
The paper appears to resolve an open problem by closing the existing minimax rate gap for smooth calibration and calibration distance. The two-test lower-bound principle seems to be a useful theoretical contribution. The results on kernel calibration are also interesting. The paper is well written and easy to follow.
Critical weaknesses
I am not familiar with the online calibration literature, so I cannot reliably assess the novelty and significance of the results relative to existing work. Although the mathematical arguments appear reasonable from my limited reading, I am also unable to assess the correctness of all the technical proofs with sufficient confidence.
Questions for authors
NA
Thanks
Thank you so much for your time and review, and your positive assessment. We're glad you found the paper well written!