Theoretical Advances in Neural Computation and Learning

Overview

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 ...

See more details below
Paperback (Softcover reprint of the original 1st ed. 1994)
$204.83
BN.com price
(Save 17%)$247.00 List Price
Other sellers (Paperback)
  • All (4) from $181.95   
  • New (3) from $181.95   
  • Used (1) from $261.61   
Sending request ...

Overview

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.

Read More Show Less

Product Details

  • ISBN-13: 9781461361602
  • Publisher: Springer US
  • Publication date: 12/31/2012
  • Edition description: Softcover reprint of the original 1st ed. 1994
  • Edition number: 1
  • Pages: 468
  • Product dimensions: 6.14 (w) x 9.21 (h) x 1.00 (d)

Table of Contents

Foreword
Foreword
Preface
Pt. I Computational Complexity of Neural Networks 1
1 Neural Models and Spectral Methods 3
2 Depth-Efficient Threshold Circuits for Arithmetic Functions 37
3 Communication Complexity and Lower Bounds for Threshold Circuits 85
4 A Comparison of the Computational Power of Sigmoid and Boolean Threshold Circuits 127
5 Computing on Analog Neural Nets with Arbitrary Real Weights 153
6 Connectivity Versus Capacity in the Hebb Rule 173
Pt. II Learning and Neural Networks 241
7 Computational Learning Theory and Neural Networks: A Survey of Selected Topics 243
8 Perspectives of Current Research About the Complexity of Learning on Neural Nets 295
9 Learning an Intersection of K Halfspaces Over a Uniform Distribution 337
10 On the Intractability of Loading Neural Networks 357
11 Learning Boolean Functions via the Fourier Transform 391
12 LMS and Backpropagation are Minimax Filters 425
13 Supervised Learning: Can it Escape its Local Minimum? 449
Index 463
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)