Abstract

This book describes theoretical advances in the study of artificial neural networks. It explores probabilistic models of supervised learning problems, and addresses the key statistical and computational questions. Research on pattern classification with binary-output networks is surveyed, including a discussion of the relevance of the Vapnik–Chervonenkis dimension, and calculating estimates of the dimension for several neural network models. A model of classification by real-output networks is developed, and the usefulness of classification with a 'large margin' is demonstrated. The authors explain the role of scale-sensitive versions of the Vapnik–Chervonenkis dimension in large margin classification, and in real prediction. They also discuss the computational complexity of neural network learning, describing a variety of hardness results, and outlining two efficient constructive learning algorithms. The book is self-contained and is intended to be accessible to researchers and graduate students in computer science, engineering, and mathematics

Keywords

Artificial neural networkArtificial intelligenceComputer scienceMargin (machine learning)Machine learningDimension (graph theory)VC dimensionConstructiveKey (lock)Probabilistic logicRelevance (law)Nervous system network modelsVariety (cybernetics)Types of artificial neural networksRecurrent neural networkMathematicsProcess (computing)

Affiliated Institutions

Related Publications

Publication Info

Year
2009
Type
book
Citations
1356
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

1356
OpenAlex

Cite This

Martin Anthony, Peter L. Bartlett (2009). Neural network learning theoretical foundations. . https://doi.org/10.1017/cbo9780511624216

Identifiers

DOI
10.1017/cbo9780511624216