arXiv (All)
open access
Computational and Statistical Hardness of Calibration Distance
The distance from calibration, introduced by Błasiok, Gopalan, Hu, and Nakkiran (STOC 2023), has recently emerged as a central measure of miscalibration for probabilistic predictors. We study the fundamental problems of computing and estimating this quantity, given either an exact description of the
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Verification abundance, adjudication scarcity: what happens to mathematical knowledge when proof checking becomes free#793222
- Verification abundance, adjudication scarcity: what happens to mathematical knowledge when proof checking becomes free#789218
- A Dilemma for Calibrationism#81711
- Efficient Sequential Calibration with $O(T^{2/3-ε})$ Error Bound#366244
- Replication Data for: On the Generalization of Parametric and Generic Camera Models for Target-Based Calibration#412906
Record · ID 1355561
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive