Presents polynomial-time algorithms for 2D forecasting with Õ(√(kT)) swap regret and extensions to higher dimensions with Õ(d√(kT)) bounds, improving prior regret and runtime results.
Provably good mesh generation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Improved Multi-Dimensional Forecasting for Swap Regret
Presents polynomial-time algorithms for 2D forecasting with Õ(√(kT)) swap regret and extensions to higher dimensions with Õ(d√(kT)) bounds, improving prior regret and runtime results.