Apple tasting.
From MaRDI portal
Recommendations
Cites work
- A theory of the learnable
- scientific article; zbMATH DE number 1256687 (Why is no real title available?)
- scientific article; zbMATH DE number 1306865 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3420728 (Why is no real title available?)
- Learning Boolean functions in an infinite attribute space
- Learning in the presence of finitely or infinitely many irrelevant attributes
- Occam's razor
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- On-line learning with linear loss constraints.
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- Prediction-preserving reducibility
- Probably Approximate Learning of Sets and Functions
- Queries and concept learning
- Statistical decision theory. Foundations, concepts, and methods
- The weighted majority algorithm
Cited in
(8)- Randomized prediction of individual sequences
- On-line learning with linear loss constraints.
- Improved lower bounds for learning from noisy examples: An information-theoretic approach
- New bounds on the price of bandit feedback for mistake-bounded online multiclass learning
- Knows what it knows: a framework for self-aware learning
- Learning noisy linear classifiers via adaptive and selective sampling
- scientific article; zbMATH DE number 1256687 (Why is no real title available?)
- Using the doubling dimension to analyze the generalization of learning algorithms
This page was built for publication: Apple tasting.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854360)
