Abstract:
I'll show how the celebrated ‘exponential weight algorithm’ can be generalized into the vectorial setting (related to multi-criteria optimization) called Blackwell approachability. As applications, I will show how it can be used to construct simple and efficient algorithms that minimize refined versions of regret or that are calibrated, with respect to the family of all balls.