An introduction to natural computation

Bibliographic Information

An introduction to natural computation

Dana H. Ballard

(Complex adaptive systems)(Bradford book)

MIT Press, 1999, c1997

1st MIT Press pbk. ed

  • : pbk

Available at  / 19 libraries

Search this Book/Journal

Note

Includes bibliographical references and index

Description and Table of Contents

Description

This book provides a comprehensive introduction to the computational material that forms the underpinnings of the currently evolving set of brain models. It is now clear that the brain is unlikely to be understood without recourse to computational theories. The theme of An Introduction to Natural Computation is that ideas from diverse areas such as neuroscience, information theory, and optimization theory have recently been extended in ways that make them useful for describing the brains programs. This book provides a comprehensive introduction to the computational material that forms the underpinnings of the currently evolving set of brain models. It stresses the broad spectrum of learning models-ranging from neural network learning through reinforcement learning to genetic learning-and situates the various models in their appropriate neural context. To write about models of the brain before the brain is fully understood is a delicate matter. Very detailed models of the neural circuitry risk losing track of the task the brain is trying to solve. At the other extreme, models that represent cognitive constructs can be so abstract that they lose all relationship to neurobiology. An Introduction to Natural Computation takes the middle ground and stresses the computational task while staying near the neurobiology.

Table of Contents

  • Natural computation: introduction
  • the brain
  • computational theory
  • elements of natural computation
  • overview
  • the grand challenge
  • notes
  • exercises. Part 1 Core concepts: fitness - introduction, Baye's rule, probability distributions, information theory, appendix: laws of probability, notes, exercises
  • programs - introduction, heuristic search, two-person games, biological state spaces, notes, exercises
  • data - data compression, coordinate systems, Eigenvalues and Eigenvectors, random vectors, high-dimensional spaces, clustering, appendix: linear algebra review, notes, exercises
  • dynamics - overview, linear systems, nonlinear systems, appendix: taylor series, notes, exercises
  • optimization - introduction minimization algorithms, the method of Lagrange multipliers, optimal control . Part 2 Memories: content-addressable memory - introduction, Hopfield memories, Kanerva memories, radial basis functions, Kalman filtering, notes, exercises
  • supervised learning - introduction, perceptions, continuous activation functions, recurrent networks, minimum description length, the activation function, notes, exercises
  • unsupervised learning - introduction, principal components, competitive learning, topological constraints, supervised competitive learning, multimodal data, independent components, notes, exercises. Part 3 Programs: Markov models - hidden Markov models - notes, exercises
  • reinforcement learning - introduction, Markov decision process, the Core ideas - policy improvement, Q-learning, temporal-difference learning, learning with a teacher, partially observable MDPs, summary, notes, exercises. Part 4 Systems: genetic algorithms - introduction, schemata, determining fitness
  • genetic programming - introduction, genetic operators for programs, genetic programming, analysis, modules, summary
  • summary - learning to react - memories, learning during a lifetime - programs, learning across generations - systems, the grand challenge revisited, note.

by "Nielsen BookData"

Related Books: 1-2 of 2

Details

Page Top