New algorithms for neural Principal Component and Independent Component Analysis (PCA and ICA) are introduced. Special emphasis is laid on the locality of learning. This enables a simpler hardware implementation, and may provide a more plausible model of biological neurons. To achieve this, the algorithms feature a new kind of feedback which is multiplicative and anti-Hebbian. The convergence of the ICA algorithm is proven analytically in the general case; the convergence of the PCA algorithm is proven for Gaussian data.
CITATION STYLE
Hyvätrinen, A. (1996). Purely local neural Principal Component and Independent Component learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1112 LNCS, pp. 140–144). Springer Verlag. https://doi.org/10.1007/3-540-61510-5_27
Mendeley helps you to discover research relevant for your work.