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


     


This Article
Right arrow Full Text
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 Similar articles in PubMed
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 Ay, N.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Ay, N.
(Neural Computation. 2002;14:2959-2980.)
© 2002 The MIT Press


Letter

Locality of Global Stochastic Interaction in Directed Acyclic Networks

Nihat Ay

nay{at}mis.mpg.de, Max-Planck-Institute for Mathematics in the Sciences, 04103 Leipzig, Germany

The hypothesis of invariant maximization of interaction (IMI) is formulated within the setting of random fields. According to this hypothesis, learning processes maximize the stochastic interaction of the neurons subject to constraints. We consider the extrinsic constraint in terms of a fixed input distribution on the periphery of the network. Our main intrinsic constraint is given by a directed acyclic network structure. First mathematical results about the strong relation of the local information flow and the global interaction are stated in order to investigate the possibility of controlling IMI optimization in a completely local way. Furthermore, we discuss some relations of this approach to the optimization according to Linsker's Infomax principle.




This article has been cited by other articles:


Home page
Neural Comput.Home page
A. S. Klyubin, D. Polani, and C. L. Nehaniv
Representations of space and time in the maximization of information flow in the perception-action loop.
Neural Comput., September 1, 2007; 19(9): 2387 - 2432.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
T. Wennekers and N. Ay
Finite State Automata Resulting from Temporal Information Maximization and a Temporal Learning Rule
Neural Comput., October 1, 2005; 17(10): 2258 - 2290.
[Abstract] [Full Text] [PDF]




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