2017
Online Learning and Blackwell Approachability with Partial Monitoring: Optimal Convergence Rates
AISTATS 2017poster
Blackwell approachability is an online learning setup generalizing the classical problem of regret minimization by allowing for instance multi-criteria optimization, global (online) optimization of a convex loss, or online linear optimization under some cumulative constraint. We consider partial mon…