State dependent computation using coupled recurrent networks
Ueli Rutishauser, Rodney J. Douglas

TL;DR
This paper demonstrates how coupled recurrent neural networks can embed reliable finite state machines, providing insights into neuronal mechanisms for conditional behavioral state switching in the cortex.
Contribution
It introduces a simple method to create multi-stable neuronal networks using coupled sWTA networks with transition neurons, enabling state-dependent processing.
Findings
Networks can embed reliable finite state machines
Coupling two sWTA networks creates multi-stability
Small specialized transition neurons enable state transitions
Abstract
Although conditional branching between possible behavioural states is a hallmark of intelligent behavior, very little is known about the neuronal mechanisms that support this processing. In a step toward solving this problem we demonstrate by theoretical analysis and simulation how networks of richly inter-connected neurons, such as those observed in the superficial layers of the neocortex, can embed reliable robust finite state machines. We show how a multi-stable neuronal network containing a number of states can be created very simply, by coupling two recurrent networks whose synaptic weights have been configured for soft winner-take-all (sWTA) performance. These two sWTAs have simple, homogenous locally recurrent connectivity except for a small fraction of recurrent cross-connections between them, which are used to embed the required states. This coupling between the maps allows the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
