Collective stability of networks of winner-take-all circuits
Name
Slotine-2011-Collective Stability of Networks of Winner.pdf
Size
2.07 MB
Format
Adobe PDF
Checksum (MD5)
185451a51a13fffe3dbc6a15907256e3
Author(s)
Slotine, Jean-Jacques E.
Douglas, Rodney J.
Rutishauser, Ueli
Date Issued
February 2011
Journal
Neural Computation
Publisher
MIT Press
Citation
Rutishauser, Ueli, Rodney J. Douglas, and Jean-Jacques Slotine. “Collective Stability of Networks of Winner-Take-All Circuits.” Neural Computation 23 (2011): 735-773. Web. 19 Oct. 2011.
Version
Final published version
Abstract
The neocortex has a remarkably uniform neuronal organization, suggesting that common principles of processing are employed throughout its extent. In particular, the patterns of connectivity observed in the superficial layers of the visual cortex are consistent with the recurrent excitation and inhibitory feedback required for cooperative-competitive circuits such as the soft winner-take-all (WTA). WTA circuits offer interesting computational properties such as selective amplification, signal restoration, and decision making. But these properties depend on the signal gain derived from positive feedback, and so there is a critical trade-off between providing feedback strong enough to support the sophisticated computations while maintaining overall circuit stability. The issue of stability is all the more intriguing when one considers that the WTAs are expected to be densely distributed through the superficial layers and that they are at least partially interconnected. We consider how to reason about stability in very large distributed networks of such circuits. We approach this problem by approximating the regular cortical architecture as many interconnected cooperative-competitive modules. We demonstrate that by properly understanding the behavior of this small computational module, one can reason over the stability and convergence of very large networks composed of these modules. We obtain parameter ranges in which the WTA circuit operates in a high-gain regime, is stable, and can be aggregated arbitrarily to form large, stable networks. We use nonlinear contraction theory to establish conditions for stability in the fully nonlinear case and verify these solutions using numerical simulations. The derived bounds allow modes of operation in which the WTA network is multistable and exhibits state-dependent persistent activities. Our approach is sufficiently general to reason systematically about the stability of any network, biological or technological, composed of networks of small modules that express competition through shared inhibition.
MIT Department
Massachusetts Institute of Technology. Department of Mechanical Engineering
Massachusetts Institute of Technology. Nonlinear Systems Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1162/NECO_a_00091
