1 paper · 1 filter
Tim van Erven, Sarah Sachs, Wouter M. Koolen +1
We consider online convex optimization when a number k of data points are outliers that may be corrupted. We model this by introducing the notion of robust regret, which measures t…