Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness

Dec-23-2025, 17:00:32 GMT–Neural Information Processing Systems

Stochastic and adversarial data are two widely studied settings in online learning. But many optimizationtasks are neither i.i.d.

adversarial online convex optimization, improved regret bound, name change, (5 more...)

Neural Information Processing Systems

Dec-23-2025, 17:00:32 GMT

Conferences Web Page

Technology:
- Information Technology > Artificial Intelligence (0.61)