Apple tasting.
From MaRDI portal
Publication:1854360
DOI10.1006/inco.2000.2870zbMath1045.68573OpenAlexW2913292478MaRDI QIDQ1854360
Nicholas Littlestone, Philip M. Long, David P. Helmbold
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c631dc7b29651eec767ea0e4970d638719c55e8e
Related Items (7)
Knows what it knows: a framework for self-aware learning ⋮ Learning noisy linear classifiers via adaptive and selective sampling ⋮ Using the doubling dimension to analyze the generalization of learning algorithms ⋮ Randomized prediction of individual sequences ⋮ New bounds on the price of bandit feedback for mistake-bounded online multiclass learning ⋮ On-line learning with linear loss constraints. ⋮ Improved lower bounds for learning from noisy examples: An information-theoretic approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Prediction-preserving reducibility
- Occam's razor
- Statistical decision theory. Foundations, concepts, and methods
- Learning Boolean functions in an infinite attribute space
- The weighted majority algorithm
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- On-line learning with linear loss constraints.
- Learning in the presence of finitely or infinitely many irrelevant attributes
- Queries and concept learning
- Probably Approximate Learning of Sets and Functions
- A theory of the learnable
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
This page was built for publication: Apple tasting.
