Gao, Yuanxiang (2023) A computational model of learning flexible navigation in a maze by layout-conforming replay of place cells. Frontiers in Computational Neuroscience, 17. ISSN 1662-5188
pubmed-zip/versions/1/package-entries/fncom-17-1053097/fncom-17-1053097.pdf - Published Version
Download (3MB)
Abstract
Recent experimental observations have shown that the reactivation of hippocampal place cells (PC) during sleep or wakeful immobility depicts trajectories that can go around barriers and can flexibly adapt to a changing maze layout. However, existing computational models of replay fall short of generating such layout-conforming replay, restricting their usage to simple environments, like linear tracks or open fields. In this paper, we propose a computational model that generates layout-conforming replay and explains how such replay drives the learning of flexible navigation in a maze. First, we propose a Hebbian-like rule to learn the inter-PC synaptic strength during exploration. Then we use a continuous attractor network (CAN) with feedback inhibition to model the interaction among place cells and hippocampal interneurons. The activity bump of place cells drifts along paths in the maze, which models layout-conforming replay. During replay in sleep, the synaptic strengths from place cells to striatal medium spiny neurons (MSN) are learned by a novel dopamine-modulated three-factor rule to store place-reward associations. During goal-directed navigation, the CAN periodically generates replay trajectories from the animal's location for path planning, and the trajectory leading to a maximal MSN activity is followed by the animal. We have implemented our model into a high-fidelity virtual rat in the MuJoCo physics simulator. Extensive experiments have demonstrated that its superior flexibility during navigation in a maze is due to a continuous re-learning of inter-PC and PC-MSN synaptic strength.
Item Type: | Article |
---|---|
Subjects: | Archive Paper Guardians > Medical Science |
Depositing User: | Unnamed user with email support@archive.paperguardians.com |
Date Deposited: | 30 Mar 2023 09:44 |
Last Modified: | 13 Mar 2024 04:26 |
URI: | http://archives.articleproms.com/id/eprint/461 |