Sari la conținut
aiqbenchInformații despre AI & calcul cuantic
ȘtiriAnalizeBenchmark-uriSkill-uriÎntreabă AIÎnvațăDespre
...Se încarcă sesiunea
ȘtiriAnalizeBenchmark-uriSkill-uriÎntreabă AIÎnvațăDespre

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

Înapoi la listă
perspectiva aiqbenchMachine learning

analiza aiqbench

This paper resolves the theoretical gap in sequential prediction by establishing a tight $\Omega(\sqrt{T})$ lower bound for smooth calibration error against adaptive adversaries. By forcing forecasters to incur higher costs when compensating for past residuals, the authors settle the minimax rates for these robustness measures, with proof concepts partially aided by AI tools.
1
Sursă care acoperăarXiv

A Matching Lower Bound for Online Smooth Calibration

arXiv·13 noiembrie 2026·2 min de citit·Articolul și perspectiva sunt în engleză.

De la arXiv

Text integral

arXiv:2611.16097v1 Announce Type: new Abstract: We study smooth calibration error in sequential binary prediction, which measures how far a sequence of probabilistic forecasts is from being calibrated and, unlike the classical expected calibration error, is robust to small perturbations of the forecasts. Against adaptive adversaries, the minimax smooth calibration error is known to lie between $\Omega(T^{1/3})$ and $O(\sqrt{T})$ (Qiao and Zheng, 2024), where $T$ is the number of rounds. In this paper, we close this gap by constructing a new adversary whose outcome mean moves with the forecaster's cumulative residual.

This design makes compensating for past residuals costly, and forces every forecaster to incur an expected smooth calibration error of $\Omega(\sqrt{T})$. This lower bound matches the known upper bound up to universal constants, and further implies $\Omega(\sqrt{T})$ lower bounds for calibration distance and lower calibration distance. Overall, our results settle the minimax rates of these calibration measures in sequential prediction. The proof ideas are partially developed by GPT-6 Astra under the authors' guidance.

Abstract:We study smooth calibration error in sequential binary prediction, which measures how far a sequence of probabilistic forecasts is from being calibrated and, unlike the classical expected calibration error, is robust to small perturbations of the forecasts. Against adaptive adversaries, the minimax smooth calibration error is known to lie between $\Omega(T^{1/3})$ and $O(\sqrt{T})$ (Qiao and Zheng, 2024), where $T$ is the number of rounds. In this paper, we close this gap by constructing a new adversary whose outcome mean moves with the forecaster's cumulative residual.

This design makes compensating for past residuals costly, and forces every forecaster to incur an expected smooth calibration error of $\Omega(\sqrt{T})$. This lower bound matches the known upper bound up to universal constants, and further implies $\Omega(\sqrt{T})$ lower bounds for calibration distance and lower calibration distance. Overall, our results settle the minimax rates of these calibration measures in sequential prediction. The proof ideas are partially developed by GPT-6 Astra under the authors' guidance.

Machine Learning (cs.LG); Machine Learning (stat.ML)

arXiv:2611.16097 [cs.LG]

(or arXiv:2611.16097v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2611.16097 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 255 cuvinte

Citește pe arXiv ↗Întreabă despre acest articol

Subiecte conexe

Machine learning

Strength Controls Change How Interventions Compare Across Sparse Autoencoder Codes

arXiv · 21 oct. 2026

Siguranță AI

Extractable Memorization From First Principles

arXiv · 30 sept. 2026

Machine learning

Winner's Curse Drives False Promises in Data-Driven Decisions

arXiv · 27 oct. 2026

Cercetare AI

Damage Predicts Recovery: When Calibration Data Matters in Compressing Financial LLMs

arXiv · 23 sept. 2026

Article info

Source

arXiv

Published

13 noiembrie 2026

Read time

2 min

Category

Machine learning
aiqbench
Informații despre AI & calcul cuantic© aiqbench. Toate drepturile rezervate.

Fluxuri:RSS·JSON Feed

LimbăEnglish·Românăbeta
ȘtiriAI & tehnologieCuanticAnalize
ExploreazăBenchmark-uriÎnvață
CompanieDespreÎncredereInformații legaleTermeni și condițiiPolitica de confidențialitateNotificări privind drepturile de autorȘtergerea datelorRaportează conținut

Perspectiva aiqbench, analizele, rezumatul zilnic și răspunsurile din Întreabă sunt scrise de modele AI din sursele afișate, fără revizuire editorială înainte de publicare. Pot conține erori — verifică sursa. Cum este folosit modelul →

  • Știri
  • Analize
  • Întreabă
  • Topuri
  • Cont