Neural network design and the complexity of learning / (Record no. 73058)

000 -LEADER
fixed length control field 03817nam a2200553 i 4500
001 - CONTROL NUMBER
control field 6267404
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220712204655.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 151223s1990 maua ob 001 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9780262276559
-- ebook
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- electronic
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- electronic
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- electronic
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- print
082 0# - CLASSIFICATION NUMBER
Call Number 006.3
100 1# - AUTHOR NAME
Author Judd, J. Stephen,
245 10 - TITLE STATEMENT
Title Neural network design and the complexity of learning /
300 ## - PHYSICAL DESCRIPTION
Number of Pages 1 PDF (150 pages) :
490 1# - SERIES STATEMENT
Series statement Neural network modeling and connectionism
500 ## - GENERAL NOTE
Remark 1 "A Bradford book."
520 ## - SUMMARY, ETC.
Summary, etc Using the tools of complexity theory, Stephen Judd develops a formal description of associative learning in connectionist networks. He rigorously exposes the computational difficulties in training neural networks and explores how certain design principles will or will not make the problems easier.Judd looks beyond the scope of any one particular learning rule, at a level above the details of neurons. There he finds new issues that arise when great numbers of neurons are employed and he offers fresh insights into design principles that could guide the construction of artificial and biological neural networks.The first part of the book describes the motivations and goals of the study and relates them to current scientific theory. It provides an overview of the major ideas, formulates the general learning problem with an eye to the computational complexity of the task, reviews current theory on learning, relates the book's model of learning to other models outside the connectionist paradigm, and sets out to examine scale-up issues in connectionist learning.Later chapters prove the intractability of the general case of memorizing in networks, elaborate on implications of this intractability and point out several corollaries applying to various special subcases. Judd refines the distinctive characteristics of the difficulties with families of shallow networks, addresses concerns about the ability of neural networks to generalize, and summarizes the results, implications, and possible extensions of the work.J. Stephen Judd is Visiting Assistant Professor of Computer Science at The California Institute of Technology. Neural Network Design and the Complexity of Learning is included in the Network Modeling and Connectionism series edited by Jeffrey Elman.
856 42 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267404
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cambridge, Massachusetts :
-- MIT Press,
-- c1990.
264 #2 -
-- [Piscataqay, New Jersey] :
-- IEEE Xplore,
-- [1990]
336 ## -
-- text
-- rdacontent
337 ## -
-- electronic
-- isbdmedia
338 ## -
-- online resource
-- rdacarrier
588 ## -
-- Description based on PDF viewed 12/23/2015.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Artificial intelligence.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computational complexity.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Neural computers.

No items available.