Minimizing Regret With Label Efficient Prediction
From MaRDI portal
Publication:3546663
DOI10.1109/TIT.2005.847729zbMath1295.68183WikidataQ59538595 ScholiaQ59538595MaRDI QIDQ3546663
Gilles Stoltz, Nicolò Cesa-Bianchi, Gábor Lugosi
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Inference from stochastic processes and prediction (62M20) Learning and adaptive systems in artificial intelligence (68T05) Statistical aspects of information-theoretic topics (62B10)
Related Items
Regret minimization, willingness-to-accept-losses and framing ⋮ Improved second-order bounds for prediction with expert advice ⋮ Adaptive and optimal online linear regression on \(\ell^1\)-balls ⋮ Algorithm portfolio selection as a bandit problem with unbounded losses ⋮ Knows what it knows: a framework for self-aware learning ⋮ Fano's inequality for random variables ⋮ Quadratic Error Minimization in a Distributed Environment with Privacy Preserving ⋮ Tracking climate models ⋮ Online Learning over a Finite Action Set with Limited Switching ⋮ Partial Monitoring—Classification, Regret Bounds, and Algorithms ⋮ Small-Loss Bounds for Online Learning with Partial Information