An improved VC dimension bound for sparse polynomials

DOI10.1007/978-3-540-27819-1_27MaRDI QIDQ4680892zbMATH OpenOpenAlexFDO

Authors Michael Schmitt

Publication date 13 June 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98522

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions
• Neural Nets with Superlinear VC-Dimension
• On the Capabilities of Higher-Order Neurons: A Radial Basis Function Approach
• scientific article; zbMATH DE number 1263195
• Radial basis function neural networks have superlinear VC dimension

Cited in

(5)

• Fast construction of constant bound functions for sparse polynomials
• Bernstein's second theorem and Viro's method for sparse polynomial systems in chemistry
• VC bounds on the cardinality of nearly orthogonal function classes
• VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions
• On the Capabilities of Higher-Order Neurons: A Radial Basis Function Approach

This page was built for publication: An improved VC dimension bound for sparse polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680892)