PAC-learning from general examples
From MaRDI portal
Recommendations
Cites work
- A combinatorial problem; stability and order for models and theories in infinitary languages
- A theory of the learnable
- An extremal problem for Graham-Rothschild parameter words
- Bounding sample size with the Vapnik-Chervonenkis dimension
- Density and dimension
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Learnability and the Vapnik-Chervonenkis dimension
- On the density of families of sets
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Vapnik-Chervonenkis Classes of Definable Sets
Cited in
(12)- A note on learning from multiple-instance examples
- PAC learning of concept classes through the boundaries of their items
- Sample complexity of model-based search
- A new PAC bound for intersection-closed concept classes
- The optimal PAC bound for intersection-closed concept classes
- Higher dimensional PAC learning
- scientific article; zbMATH DE number 1104347 (Why is no real title available?)
- PAC learning with simple examples
- scientific article; zbMATH DE number 862675 (Why is no real title available?)
- PAC-MDL bounds.
- The Myth of Generic DPA…and the Magic of Learning
- PAC-learning with approximate predictors
This page was built for publication: PAC-learning from general examples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392015)