Minimizing regret with label-efficient prediction

Abstract : We investigate label efficient prediction, a variant, proposed by Helmbold and Panizza, of the problem of prediction with expert advice. In this variant the forecaster, after guessing the next element of the sequence to be predicted, does not observe its true value unless he asks for it, which he cannot do too often. We determine matching upper and lower bounds for the best possible excess prediction error, with respect to the best possible constant predictor, when the number of allowed queries is fixed. We also prove that Hannan consistency, a fundamental property in game-theoretic prediction models, can be achieved by a forecaster issuing a number of queries growing to infinity at a rate just slightly faster than logarithmic in the number of prediction rounds.
Document type :
Journal articles
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00007537
Contributor : Gilles Stoltz <>
Submitted on : Friday, July 15, 2005 - 4:38:08 PM
Last modification on : Tuesday, April 2, 2019 - 2:16:14 PM
Long-term archiving on : Thursday, April 1, 2010 - 10:02:56 PM

Identifiers

  • HAL Id : hal-00007537, version 1

Collections

Citation

Nicolo Cesa-Bianchi, Gabor Lugosi, Gilles Stoltz. Minimizing regret with label-efficient prediction. IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2005, 51, pp.2152-2162. ⟨hal-00007537⟩

Share

Metrics

Record views

192

Files downloads

229