Improved second-order bounds for prediction with expert advice
Machine Learning
Regret Minimization Under Partial Monitoring
Mathematics of Operations Research
Knows what it knows: a framework for self-aware learning
Proceedings of the 25th international conference on Machine learning
Active learning with confidence
HLT-Short '08 Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers
Sequential prediction under incomplete feedback
Proceedings of the 2007 conference on Artificial Intelligence Research and Development
Combining multiple heuristics online
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Restart schedules for ensembles of problem instances
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Improved rates for the stochastic continuum-armed bandit problem
COLT'07 Proceedings of the 20th annual conference on Learning theory
Regret Bounds and Minimax Policies under Partial Monitoring
The Journal of Machine Learning Research
Quadratic error minimization in a distributed environment with privacy preserving
PSDML'10 Proceedings of the international ECML/PKDD conference on Privacy and security issues in data mining and machine learning
Internal Regret with Partial Monitoring: Calibration-Based Optimal Algorithms
The Journal of Machine Learning Research
Algorithm portfolio selection as a bandit problem with unbounded losses
Annals of Mathematics and Artificial Intelligence
Hannan consistency in on-line learning in case of unbounded losses under partial monitoring
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
The shortest path problem under partial monitoring
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Improved second-order bounds for prediction with expert advice
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Privacy Preserving Aggregation of Secret Classifiers
Transactions on Data Privacy
Toward a classification of finite partial-monitoring games
Theoretical Computer Science
Cost-sensitive online active learning with application to malicious URL detection
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Selective sampling and active learning from single and multiple teachers
The Journal of Machine Learning Research
An active learning approach to home heating in the smart grid
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Adaptive and optimal online linear regression on ℓ1-balls
Theoretical Computer Science
| Hi-index | 754.84 |
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.