arXiv (All)
open access
Instance-Adaptive Online Multiclass Multicalibration
We study online multiclass multicalibration over $T$ rounds, and give an algorithm with beyond-worst-case guarantees. With $n$ possible outcomes, forecasts lie in a simplex of dimension $d=n-1$. In the worst case, cumulative $\ell_1$ multicalibration error scales with $\widetildeΘ(T^{(d+1)/(d+2)})$,
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
- Breaking the $T^{2/3}$ Barrier for Sequential Calibration#1123907
- High-dimensional online calibration from harmonic weights#1217115
- Online Bayesian Calibration under Gradual and Abrupt System Changes#168314
- Leggett-type inequalities for testing nonlocal realism in multipartite systems#925008
- Leggett-type inequalities for testing nonlocal realism in multipartite systems#920774
Record · ID 1327544
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