Theoretical Advances in Neural Computation and Learning [Hardcover]

Vwani Roychowdhury (Editor), Kai-Yeung Siu (Editor), Alon Orlitsky (Editor)

Book Description

ISBN-10: 079239478X | ISBN-13: 978-0792394785 | Publication Date: November 30, 1994 | Edition: 1

Theoretical Advances in Neural Computation and Learning brings together in one volume some of the recent advances in the development of a theoretical framework for studying neural networks. A variety of novel techniques from disciplines such as computer science, electrical engineering, statistics, and mathematics have been integrated and applied to develop ground-breaking analytical tools for such studies. This volume emphasizes the computational issues in artificial neural networks and compiles a set of pioneering research works, which together establish a general framework for studying the complexity of neural networks and their learning capabilities. This book represents one of the first efforts to highlight these fundamental results, and provides a unified platform for a theoretical exploration of neural computation. Each chapter is authored by a leading researcher and/or scholar who has made significant contributions in this area. Part 1 provides a complexity theoretic study of different models of neural computation. Complexity measures for neural models are introduced, and techniques for the efficient design of networks for performing basic computations, as well as analytical tools for understanding the capabilities and limitations of neural computation are discussed. The results describe how the computational cost of a neural network increases with the problem size. Equally important, these results go beyond the study of single neural elements, and establish to computational power of multilayer networks. Part 2 discusses concepts and results concerning learning using models of neural computation. Basic concepts such as VC-dimension and PAC-learning are introduced, and recent results relating neural networks to learning theory are derived. In addition, a number of the chapters address fundamental issues concerning learning algorithms, such as accuracy and rate of convergence, selection of training data, and efficient algorithms for learning useful classes of mappings.

Product Details

• Hardcover: 496 pages
• Publisher: Springer; 1 edition (November 30, 1994)
• Language: English
• ISBN-10: 079239478X
• ISBN-13: 978-0792394785
• Product Dimensions: 9.4 x 6.2 x 1.3 inches
• Shipping Weight: 2.2 pounds (View shipping rates and policies)
• Amazon Best Sellers Rank: #8,526,379 in Books (See Top 100 in Books)