Learning Theory
From MaRDI portal
Publication:4680892
DOI10.1007/B98522zbMATH Open1078.68053OpenAlexW4206057230MaRDI QIDQ4680892FDOQ4680892
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
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32)
Cited In (5)
- On the Capabilities of Higher-Order Neurons: A Radial Basis Function Approach
- VC bounds on the cardinality of nearly orthogonal function classes
- VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions
- Fast construction of constant bound functions for sparse polynomials
- Bernstein's second theorem and Viro's method for sparse polynomial systems in chemistry
This page was built for publication: Learning Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680892)