In:
Neural Computation, MIT Press, Vol. 10, No. 3 ( 1998-04-01), p. 671-716
Abstract:
Computational models of neural map formation can be considered on at least three different levels of abstraction: detailed models including neural activity dynamics, weight dynamics that abstract from the neural activity dynamics by an adiabatic approximation, and constrained optimization from which equations governing weight dynamics can be derived. Constrained optimization uses an objective function, from which a weight growth rule can be derived as a gradient flow, and some constraints, from which normalization rules are derived. In this article, we present an example of how an optimization problem can be derived from detailed nonlinear neural dynamics. A systematic investigation reveals how different weight dynamics introduced previously can be derived from two types of objective function terms and two types of constraints. This includes dynamic link matching as a special case of neural map formation. We focus in particular on the role of coordinate transformations to derive different weight dynamics from the same optimization problem. Several examples illustrate how the constrained optimization framework can help in understanding, generating, and comparing different models of neural map formation. The techniques used in this analysis may also be useful in investigating other types of neural dynamics.
Type of Medium:
Online Resource
ISSN:
0899-7667
,
1530-888X
DOI:
10.1162/089976698300017700
Language:
English
Publisher:
MIT Press
Publication Date:
1998
detail.hit.zdb_id:
1025692-1
detail.hit.zdb_id:
1498403-9
