scientific article; zbMATH DE number 2087696

zbMATH Open1077.68765MaRDI QIDQ4738577FDOQ4738577

Authors: Arturo Hernández Aguirre, Cris Koutsougeras, B. P. Buckles 

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2313/23130262.htm

Title of this publication is not available (Why is that?)

Recommendations

• Publication:4952633
• Improved bounds on the sample complexity of learning
• Estimates of Data Complexity in Neural-Network Learning
• Bounds on the complexity of neural‐network models and comparison with linear methods
• scientific article; zbMATH DE number 1843047

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cited In (15)

• On size-independent sample complexity of ReLU networks
• Learning \(C^2\) and Hölder functions
• 10.1162/153244302760200713
• Estimates of Data Complexity in Neural-Network Learning
• Gaining degrees of freedom in subsymbolic learning
• The sample complexity of learning linear predictors with the squared loss
• Learning the mapping \(\mathbf{x}\mapsto \sum\limits_{i=1}^d x_i^2\): the cost of finding the needle in a haystack
• Using virtual sample generation to build up management knowledge in the early manufacturing stages
• A study of the classification of low-dimensional data with supervised manifold learning
• Title not available (Why is that?)
• A note on a priori estimations of classification circuit complexity
• Improved bounds on the sample complexity of learning
• Sample complexity bounds for the local convergence of least squares approximation
• Approximation by neural networks and learning theory
• An improved bound for learning Lipschitz functions

This page was built for publication:

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