Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring

DOI10.1007/11894841_20zbMath1168.68449OpenAlexW1600338740MaRDI QIDQ3522989

László Györfi, Peter Auer, György Ottucsák, Chamy Allenberg

Publication date: 4 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11894841_20

Mathematics Subject Classification ID

Inference from stochastic processes and prediction (62M20) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (5)

Algorithm portfolio selection as a bandit problem with unbounded losses ⋮ Learning Volatility of Discrete Time Series Using Prediction with Expert Advice ⋮ The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses ⋮ Dismemberment and design for controlling the replication variance of regret for the multi-armed bandit ⋮ Small-Loss Bounds for Online Learning with Partial Information

This page was built for publication: Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring