Label optimal regret bounds for online local learning

7 Mar 2015Pranjal AwasthiMoses CharikarKevin A. LaiAndrej Risteski

We resolve an open question from (Christiano, 2014b) posed in COLT'14 regarding the optimal dependency of the regret achievable for online local learning on the size of the label set. In this framework the algorithm is shown a pair of items at each step, chosen from a set of $n$ items... (read more)

PDF Abstract