Copyright © 1991 Published by Elsevier Ltd.
Original contribution
Received 7 May 1990;
Abstract
The Hebbian neural learning algorithm that implements Principal Component Analysis (PCA) can be extended for the analysis of more realistic forms of neural data by including higher than two-channel correlations and non-Euclidean 1p metrics. Maximizing a dth rank tensor form which correlates d channels is equivalent to raising the exponential order of variance correlation from 2 to d in the algorithm that implements PCA. Simulations suggest that a generalized version of Oja's PCA neuron can detect such a dth order principal component. Arguments from biology and pattern recognition suggest that neural data in general is not symmetric about its mean; performing PCA with an implicit 1l metric rather than the Euclidean metric weights exponentially distributed vectors according to their probability, as does a highly nonlinear Hebb rule. The correlation order d and the 1p metric exponent p were each roughly constant for each of several Hebb rules simulated. High-order correlation analysis may prove increasingly useful as data from large networks of cells engaged in information processing becomes available.
Keywords: Principal component analysis; Hebbian learning; Self-organization; Correlation functions; Multidimensional analysis; Non-Euclidean metrics; Information theory; Asymmetric coding
This work was supported by grants to C. Koch from James S. McDonnell Foundation, the Air Force Office of Scientific Research, and a NSF Presidential Young Investigator Award.
Requests for reprints should be sent to William R. Softky, Divisions of Physics and Computation and Neural Systems, 216-76 California Institute of Technology, Pasadena, CA 91125.1 D. M. K. is supported by a Weizmann Postdoctoral Fellowship from the Division of Biological Sciences.






E-mail Article
Add to my Quick Links

Cited By in Scopus (19)





