Gaining degrees of freedom in subsymbolic learning

DOI10.1016/S0304-3975(99)00289-3zbMath0977.68047OpenAlexW2058481336MaRDI QIDQ5941074

Dario Malchiodi, Bruno Apolloni

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00289-3

zbMATH Keywords

neural networksapproximate learningcomputational learningnested concept classessentry functions

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (1)

Playing monotone games to understand learning behaviors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some special Vapnik-Chervonenkis classes
• Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
• Tracking drifting concepts by minimizing disagreements
• PAC learning of concept classes through the boundaries of their items
• A general lower bound on the number of examples needed for learning
• Learnability and the Vapnik-Chervonenkis dimension
• A theory of the learnable
• Efficient noise-tolerant learning from statistical queries
• Non-Parametric Estimation II. Statistically Equivalent Blocks and Tolerance Regions--The Continuous Case
• Nonparametric Estimation, III. Statistically Equivalent Blocks and Multivariate Tolerance Regions--The Discontinuous Case

This page was built for publication: Gaining degrees of freedom in subsymbolic learning