CORR
2010
Springer
13 years 4 months ago
2010
Springer
We study online learning when individual instances are corrupted by adversarially chosen random noise. We assume the noise distribution is unknown, and may change over time with n...
NIPS
2007
13 years 6 months ago
2007
We study the rates of growth of the regret in online convex optimization. First, we show that a simple extension of the algorithm of Hazan et al eliminates the need for a priori k...