Optimal prediction using expert advice and randomized Littlestone dimension
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- scientific article; zbMATH DE number 3446442 (Why is no real title available?)
- scientific article; zbMATH DE number 7164746 (Why is no real title available?)
- scientific article; zbMATH DE number 3085434 (Why is no real title available?)
- A characterization of multiclass learnability
- A decision-theoretic generalization of on-line learning and an application to boosting
- Active classification with comparison queries
- Adversarial laws of large numbers and optimal regret in online classification
- Continuous Experts and the Binning Algorithm
- How to use expert advice
- Learnability and the Vapnik-Chervonenkis dimension
- Learning with continuous experts using drifting games
- Minimax analysis of active learning
- Online learning and online convex optimization
- Prediction, Learning, and Games
- Private and Online Learnability Are Equivalent
- Sample complexity bounds on differentially private learning via communication complexity
- Structural results about on-line learning models with and without queries
- The weighted majority algorithm
- Theory of Disagreement-Based Active Learning
- Towards optimal algorithms for prediction with expert advice
- Understanding machine learning. From theory to algorithms
This page was built for publication: Optimal prediction using expert advice and randomized Littlestone dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6911550)
