Liquid computing on and off the edge of chaos with a striatal microcircuit.

Front Comput Neurosci

Bernstein Center Freiburg, Albert-Ludwig University of Freiburg Freiburg, Germany ; Faculty of Biology, Albert-Ludwig University of Freiburg Freiburg, Germany ; Institute for Advanced Simulation (IAS-6) and Institute of Neuroscience and Medicine (INM-6), Jülich Research Centre and JARA Jülich, Germany ; Faculty of Psychology, Institute of Cognitive Neuroscience, Ruhr-University Bochum Bochum, Germany.

Published: December 2014

In reinforcement learning theories of the basal ganglia, there is a need for the expected rewards corresponding to relevant environmental states to be maintained and modified during the learning process. However, the representation of these states that allows them to be associated with reward expectations remains unclear. Previous studies have tended to rely on pre-defined partitioning of states encoded by disjunct neuronal groups or sparse topological drives. A more likely scenario is that striatal neurons are involved in the encoding of multiple different states through their spike patterns, and that an appropriate partitioning of an environment is learned on the basis of task constraints, thus minimizing the number of states involved in solving a particular task. Here we show that striatal activity is sufficient to implement a liquid state, an important prerequisite for such a computation, whereby transient patterns of striatal activity are mapped onto the relevant states. We develop a simple small scale model of the striatum which can reproduce key features of the experimentally observed activity of the major cell types of the striatum. We then use the activity of this network as input for the supervised training of four simple linear readouts to learn three different functions on a plane, where the network is stimulated with the spike coded position of the agent. We discover that the network configuration that best reproduces striatal activity statistics lies on the edge of chaos and has good performance on all three tasks, but that in general, the edge of chaos is a poor predictor of network performance.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4240071PMC
http://dx.doi.org/10.3389/fncom.2014.00130DOI Listing

Publication Analysis

Top Keywords

edge chaos
12
striatal activity
12
states
6
striatal
5
activity
5
liquid computing
4
computing edge
4
chaos striatal
4
striatal microcircuit
4
microcircuit reinforcement
4

Similar Publications

Recent studies on topological materials are expanding into the nonlinear regime, while the central principle, namely the bulk-edge correspondence, is yet to be elucidated in the strongly nonlinear regime. Here, we reveal that nonlinear topological edge modes can exhibit the transition to spatial chaos by increasing nonlinearity, which can be a universal mechanism of the breakdown of the bulk-edge correspondence. Specifically, we unveil the underlying dynamical system describing the spatial distribution of zero modes and show the emergence of chaos.

View Article and Find Full Text PDF

Adolescent idiopathic scoliosis (AIS), which typically occurs in patients between the ages of 10 and 18, can be caused by a variety of reasons, and no definitive cause has been found. Early diagnosis of AIS or timely recognition of progression is crucial for the prevention of spinal deformity and the reduction of the risk of surgery or postponement. However, it remains a significant challenge.

View Article and Find Full Text PDF

The COVID-19 pandemic has been one of the most significant public health events in human history. Domestic violence cases surged globally during the COVID-19 pandemic. In Taiwan, this trend was particularly evident, with a year-over-year increase in reported cases.

View Article and Find Full Text PDF

The scale-free trees are fundamental dynamics networks with extensive applications in material and engineering fields owing to their high reliability and low power consumption characteristics. Controlling and optimizing transport (search) efficiency on scale-free trees has attracted much attention. In this paper, we first introduce degree-dependent weighted tree by assigning each edge (x,y) a weight wxy=(dxdy)θ, with dx and dy being the degree of nodes x and y, and θ being a controllable parameter.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!