|
|
||||||||
Letter |
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:
![]() |
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] |
||||
![]() |
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 |