Nonuniform learnability
From MaRDI portal
Recommendations
Cites work
- A general lower bound on the number of examples needed for learning
- A theory of the learnable
- Deductive learning
- Equivalence of models for polynomial learnability
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3190627 (Why is no real title available?)
- Learnability and the Vapnik-Chervonenkis dimension
- Learnability with respect to fixed distributions
- Nonuniform learnability
- Occam's razor
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Queries and concept learning
Cited in
(15)- Equivalence of models for polynomial learnability
- Efficient distribution-free learning of probabilistic concepts
- Nonuniform learnability
- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states
- Characterizing rational versus exponential learning curves
- Non-systematic search and no-good learning
- scientific article; zbMATH DE number 4060740 (Why is no real title available?)
- scientific article; zbMATH DE number 4060753 (Why is no real title available?)
- Computational limitations on learning from examples
- Learning Simple Concepts under Simple Distributions
- scientific article; zbMATH DE number 67626 (Why is no real title available?)
- scientific article; zbMATH DE number 67632 (Why is no real title available?)
- scientific article; zbMATH DE number 67636 (Why is no real title available?)
- scientific article; zbMATH DE number 522871 (Why is no real title available?)
- Projective DNF formulae and their revision.
This page was built for publication: Nonuniform learnability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329161)