Sciweavers

ALT
2015
Springer
7 years 11 months ago
Interactive Clustering of Linear Classes and Cryptographic Lower Bounds
Abstract. We study an interactive model of supervised clustering introduced by Balcan and Blum [6], where the clustering algorithm has query access to a teacher. We give an efficie...
Ádám Dániel Lelkes, Lev Reyzi...
ALT
2015
Springer
7 years 11 months ago
Scale-Free Algorithms for Online Linear Optimization
We design algorithms for online linear optimization that have optimal regret and at the same time do not need to know any upper or lower bounds on the norm of the loss vectors. We ...
Francesco Orabona, Dávid Pál
ALT
2015
Springer
7 years 11 months ago
Bounds on the Minimax Rate for Estimating a Prior over a VC Class from Independent Learning Tasks
We study the optimal rates of convergence for estimating a prior distribution over a VC class from a sequence of independent data sets respectively labeled by independent target f...
Liu Yang, Steve Hanneke, Jaime G. Carbonell