VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions
From MaRDI portal
Recommendations
- Learning Theory
- Results on learnability and the Vapnik-Chervonenkis dimension
- Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions
- VC Dimension Bounds for Analytic Algebraic Computations
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
Cited in
(14)- Computability of the additive complexity of algebraic circuits with root extracting
- On the complexity of approximating the VC dimension.
- Free resolutions of function classes via order complexes
- On the complexity of computing and learning with multiplicative neural networks
- An explicit VC-theorem for low-degree polynomials
- Estimate of a VCD image of a \(k\)-parametric template \(t = t[+,\cdot]\).
- Generalization ability of fractional polynomial models
- On the Capabilities of Higher-Order Neurons: A Radial Basis Function Approach
- Learning Theory
- Descartes' Rule of Signs for Radial Basis Function Neural Networks
- VC dimensions of principal component analysis
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
- On the decidability of sparse univariate polynomial interpolation
- Two refinements of the bound of Sauer, Perles and Shelah, and of Vapnik and Chervonenkis
This page was built for publication: VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277543)
