Minimizing Regret with Label Efficient Prediction
Nicolò Cesa-Bianchi, Gábor Lugosi and Gilles Stoltz
In: COLT 2004, 1-4 July 2004, Banff, Canada.

We investigate label efficient prediction, a variant of the problem of prediction with expert advice, proposed by Helmbold and Panizza, in which the forecaster does not have access to the outcomes of the sequence to be predicted unless he asks for it, which he can do for a limited number of times. We determine matching upper and lower bounds for the best possible excess error when the number of allowed queries is a constant. We also prove that a query rate of order $(\ln n) (\ln\ln n)^2/n$ is sufficient for achieving Hannan consistency, a fundamental property in game-theoretic prediction models. Finally, we apply the label efficient framework to pattern classification and prove a label efficient mistake bound for a randomized variant of Littlestone's zero-threshold Winnow algorithm.