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...
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 ...
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...