scientific article; zbMATH DE number 5957227

MaRDI QIDQ3093207zbMATH OpenFDO

Authors Michael Schmitt

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v5/schmitt04a.html

zbMATH Keywords

computational complexityconsistency problemlinear threshold neuronlinear-time algorithmNP-completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Neural networks for/in biological studies, artificial life and related topics (92B20)

Recommendations

• Learning theory and approximation by neural networks
• Approximation by neural networks and learning theory
• The learning problem of multi-layer neural networks
• scientific article; zbMATH DE number 774003
• Learning and generalisation. With applications to neural networks.
• scientific article; zbMATH DE number 4211541
• Neural Network Learning
• scientific article; zbMATH DE number 814401
• scientific article; zbMATH DE number 1066205
• scientific article; zbMATH DE number 503283

Cited in

(19)

• Lower bound for connectivity in local-learning neural networks
• On the complexity of recognizing regions computable by two-layered perceptrons
• Hardness results for neural network approximation problems
• Directed drift: A new linear threshold algorithm for learning binary weights on-line
• Can neural networks extrapolate? Discussion of a theorem by Pedro Domingos
• scientific article; zbMATH DE number 5856036 (Why is no real title available?)
• On the complexity of recognizing a set of vectors by a neuron
• An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}ⁿ
• Computational limitations on learning from examples
• scientific article; zbMATH DE number 67614 (Why is no real title available?)
• scientific article; zbMATH DE number 513589 (Why is no real title available?)
• scientific article; zbMATH DE number 1008380 (Why is no real title available?)
• The partitioning problem in unsupervised learning for nonlinear neurons
• Majority decisions in overlapping committees and asymptotic size of dichotomies
• The Duality Between the Perceptron Algorithm and the von Neumann Algorithm
• Complexity of learning in artificial neural networks
• Three \(\sum^ P_ 2\)-complete problems in computational learning theory
• Learning from hints in neural networks
• Learning binary perceptrons perfectly efficiently.

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 Q3093207)