An efficient online algorithm achieves O(T^{1/3}) L2-swap multicalibration against bounded linear functions, improving on the prior O(T^{3/4}) and leading to better swap omniprediction and sample complexity bounds.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Improved Bounds for Swap Multicalibration and Swap Omniprediction
An efficient online algorithm achieves O(T^{1/3}) L2-swap multicalibration against bounded linear functions, improving on the prior O(T^{3/4}) and leading to better swap omniprediction and sample complexity bounds.