Learning hurdles for sleeping experts

DOI10.1145/2090236.2090238zbMath1347.68191OpenAlexW2128592496MaRDI QIDQ2826040

Thomas Steinke, Varun Kanade

Publication date: 7 October 2016

Published in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2090236.2090238

zbMATH Keywords

online learninglower boundssleeping experts

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Probabilistic games; gambling (91A60) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Near-Optimal Algorithms for Online Matrix Prediction

Cites Work

• Unnamed Item
• The reproducible properties of correct forecasts
• The dimensions of individual strings and sequences
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• The Complexity of Forecast Testing
• The Well-Calibrated Bayesian
• Asymptotic calibration
• Dimension in Complexity Classes
• Universal prediction
• THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES

This page was built for publication: Learning hurdles for sleeping experts