Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
QUICK SEARCH:   [advanced]


     

This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Linsker, R.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Linsker, R.

Neural Computation, Vol 9, 1661-1665, Copyright © 1997 by The MIT Press

NOTES

A Local Learning Rule That Enables Information Maximization for Arbitrary Input Distributions

Ralph Linsker

This note presents a local learning rule that enables a network to maximize the mutual information between input and output vectors. The network's output units may be nonlinear, and the distribution of input vectors is arbitrary. The local algorithm also serves to compute the inverse C-1 of an arbitrary square connection weight matrix.


This article has been cited by other articles:


Home page
 Neural Comput.Home page
N. Ay
Locality of Global Stochastic Interaction in Directed Acyclic Networks
Neural Comput., December 1, 2002; 14(12): 2959 - 2980.
[Abstract] [Full Text]


HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 1997 by The MIT Press.