Neural Network Learning: Theoretical Foundations

Anthony, Martin:

ISBN 10: 052111862X / ISBN 13: 9780521118620

Published by Cambridge University Press, 2009

About this Item

404 Seiten; 9780521118620.2 Gewicht in Gramm: 1.

Seller Inventory # 1180606

Bibliographic Details

• Title: Neural Network Learning: Theoretical Foundations
• Publisher: Cambridge University Press
• Publication Date: 2009
• Language: English
• ISBN 10: 052111862X
• ISBN 13: 9780521118620
• Binding: paperback
• Condition: Sehr gut
• Weight: 1 gram
• Seller catalogs:
  • Varia

About this title

Synopsis

This important work describes recent 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. Chapters survey research on pattern classification with binary-output networks, including a discussion of the relevance of the Vapnik Chervonenkis dimension, and of estimates of the dimension for several neural network models. In addition, Anthony and Bartlett develop a model of classification by real-output networks, and demonstrate the usefulness of classification with a "large margin." The authors explain the role of scale-sensitive versions of the Vapnik Chervonenkis dimension in large margin classification, and in real prediction. Key chapters 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 accessible to researchers and graduate students in computer science, engineering, and mathematics.

Book Description

This book describes recent 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. The authors 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 essentially self-contained, since it introduces the necessary background material on probability, statistics, combinatorics and computational complexity; and it is intended to be accessible to researchers and graduate students in computer science, engineering, and mathematics.