Change-based inference in attractor nets: Linear analysis
A conventional view of information processing by line (manifold) attractor networks holds that they represent processed information by the identity, and/or location (on a null-stable manifold), of the attractor state to which they converge [1,2]. Subsequently, a readout mechanism (which we call attractor-based readout) performs decoding by identifying the converged state of the network. Although this method has been successfully applied to a variety of tasks, including orientation estimation, cue integration and decision making, there is little evidence for attractor states in cortical networks. Neurons in sensory cortical areas rarely exhibit persistent activity in natural environments, and the firing rates of most apparently persistently-active neurons in prefrontal cortical areas also change systematically over time.
We have recently suggested a new computational view of attractor networks, which involves reading information from the early portion of the trajectory of their states as they evolve towards their attractors. This change-based readout makes decisions based on the way a statistic of the state of the network changes over time [3]. We showed that this method can perform nearly as well as an ideal observer in a model visual hyperacuity task, and demonstrated its additional computational benefits such as the possibility of automatic invariance to certain irrelevant input dimensions.
Here we provide theoretical and empirical evidence that links change-based and attractor-based inference. We design a network that performs two tasks: a discrimination task (solved by change-based readout) that involves deciding if a low contrast target bar is to the left or right of a high contrast carrier bar, and an estimation task (solved by attractor-based readout) that involves determining the location of the carrier in the absence of the target. Both tasks and the network are designed such that linearization is an excellent approximation. We first show that a necessary condition for the network to be near optimal for discrimination via change-based readout is for attractor-based readout to be sub-optimal for estimation and, through the linearization, show how the network performs the two tasks. Then, we show that although the network is sub-optimal at both tasks, it is nevertheless near optimal in both cases.
References
1. Zhang, K. Representation of spatial orientation by the intrinsic dynamics of the head-direction cell ensemble: A theory. Journal of Neuroscience 16, 2112-2126 (1996)
2. Seung, H. S. How the brain keeps the eyes still. Proceedings of the National Academy of Sciences USA 93, 13339-44 (1996)
3. Moazzezi, R., Dayan, P. Change-based inference for invariant discrimination. Network: Computation in Neural Systems 19, 236-252 (2008)
Conference:
Computational and systems
neuroscience 2009, Salt Lake City, UT, United States, 26 Feb - 3 Mar, 2009.
Presentation Type:
Poster Presentation
Topic:
Poster Presentations
Citation:
(2009). Change-based inference in attractor nets: Linear analysis.
Front. Syst. Neurosci.
Conference Abstract:
Computational and systems
neuroscience 2009.
doi: 10.3389/conf.neuro.06.2009.03.020
Copyright:
The abstracts in this collection have not been subject to any Frontiers peer review or checks, and are not endorsed by Frontiers.
They are made available through the Frontiers publishing platform as a service to conference organizers and presenters.
The copyright in the individual abstracts is owned by the author of each abstract or his/her employer unless otherwise stated.
Each abstract, as well as the collection of abstracts, are published under a Creative Commons CC-BY 4.0 (attribution) licence (https://creativecommons.org/licenses/by/4.0/) and may thus be reproduced, translated, adapted and be the subject of derivative works provided the authors and Frontiers are attributed.
For Frontiers’ terms and conditions please see https://www.frontiersin.org/legal/terms-and-conditions.
Received:
29 Jan 2009;
Published Online:
29 Jan 2009.