Pages that link to "Item:Q4277543"
From MaRDI portal
The following pages link to VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions (Q4277543):
Displaying 8 items.
- Generalization ability of fractional polynomial models (Q461189) (← links)
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks (Q676431) (← links)
- On the decidability of sparse univariate polynomial interpolation (Q685722) (← links)
- Two refinements of the bound of Sauer, Perles and Shelah, and of Vapnik and Chervonenkis (Q712258) (← links)
- Computability of the additive complexity of algebraic circuits with root extracting (Q1351701) (← links)
- On the Complexity of Computing and Learning with Multiplicative Neural Networks (Q2780854) (← links)
- On the Capabilities of Higher-Order Neurons: A Radial Basis Function Approach (Q4673536) (← links)
- Descartes' Rule of Signs for Radial Basis Function Neural Networks (Q4815047) (← links)
