Nonuniform learnability
From MaRDI portal
Publication:1329161
DOI10.1016/S0022-0000(05)80005-4zbMath0806.68088OpenAlexW2913378067MaRDI QIDQ1329161
Publication date: 13 February 1995
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(05)80005-4
Related Items
Nonuniform learnability ⋮ VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states
Cites Work
- Unnamed Item
- Unnamed Item
- Learnability with respect to fixed distributions
- Occam's razor
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Equivalence of models for polynomial learnability
- Nonuniform learnability
- A general lower bound on the number of examples needed for learning
- Queries and concept learning
- Deductive learning
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities