SearcharxivSearch

arXiv subjects

Sergey A. Shuvaev

Publications and source records attributed to Sergey A. Shuvaev.

2 recordsLinked to original sources

Neural networks with motivation

How can animals behave effectively in conditions involving different motivational contexts? Here, we propose how reinforcement learning neural networks can learn optimal behavior for dynamically changing motivational salience vectors. First, we show that Q-learning neural networks with motivation can navigate in environment with dynamic rewards. Second, we show that such networks can learn complex behaviors simultaneously directed towards several goals distributed in an environment. Finally, we show that in Pavlovian conditioning task, the responses of the neurons in our model resemble the firing patterns of neurons in the ventral pallidum (VP), a basal ganglia structure involved in motivated behaviors. We show that, similarly to real neurons, recurrent networks with motivation are composed of two oppositely-tuned classes of neurons, responding to positive and negative rewards. Our model generates predictions for the VP connectivity. We conclude that networks with motivation can rapidly adapt their behavior to varying conditions without changes in synaptic strength when expected reward is modulated by motivation. Such networks may also provide a mechanism for how hierarchical reinforcement learning is implemented in the brain.

q-bio.NC

Network cloning using DNA barcodes

The ability to measure or manipulate network connectivity is the main challenge in the field of connectomics. Recently, a set of approaches has been developed that takes advantage of next generation DNA sequencing to scan connections between neurons into a set of DNA barcodes. Individual DNA sequences called markers represent single neurons, while pairs of markers, called barcodes contain information about connections. Here we propose a strategy for 'copying' or 'cloning' connectivity contained in barcodes into a clean slate tabula rasa network. We show that a one marker one cell (OMOC) rule, which forces all markers with the same sequence to condense into the same neuron, leads to fast and reliable formation of desired connectivity in a new network. We show that OMOC rule yields convergence in a number of steps given by a power law function of the network size. We thus propose that copying network connectivity from one network to another is theoretically possible.

q-bio.NC