On the learnability of rich function classes
From MaRDI portal
Publication:1305934
DOI10.1006/jcss.1998.1604zbMath0938.68049OpenAlexW1968382763MaRDI QIDQ1305934
Publication date: 22 September 1999
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1998.1604
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning from hints in neural networks
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- The degree of approximation of sets in euclidean space using sets with bounded Vapnik-Chervonenkis dimension
- On the degree of approximation by manifolds of finite pseudo-dimension
- Approximation and estimation bounds for artificial neural networks
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- Adaptive model selection using empirical complexities
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- Equivalent Norms for Sobolev Spaces
- Convergence of stochastic processes
This page was built for publication: On the learnability of rich function classes
