New algorithms minimize swap regret against arbitrary functions on convex action sets, yielding O~(T^{1/3}) ℓ2-calibration error and O~(max(T^{1/3}, sqrt(ǫT))) discretized-calibration error.
The approximation of convex sets by polyhedra
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Full Swap Regret and Discretized Calibration
New algorithms minimize swap regret against arbitrary functions on convex action sets, yielding O~(T^{1/3}) ℓ2-calibration error and O~(max(T^{1/3}, sqrt(ǫT))) discretized-calibration error.