Path-finding in real and simulated rats: assessing the influence of path characteristics on navigation learning

Tamosiunaite, M., Ainge, J., Kulvicius, T., Porr, B. , Dudchenko, P. and Worgotter, F. (2008) Path-finding in real and simulated rats: assessing the influence of path characteristics on navigation learning. Journal of Computational Neuroscience, 25(3), pp. 562-582. (doi: 10.1007/s10827-008-0094-6)

Abstract

A large body of experimental evidence suggests that the hippocampal place field system is involved in reward based navigation learning in rodents. Reinforcement learning (RL) mechanisms have been used to model this, associating the state space in an RL-algorithm to the place-field map in a rat. The convergence properties of RL-algorithms are affected by the exploration patterns of the learner. Therefore, we first analyzed the path characteristics of freely exploring rats in a test arena. We found that straight path segments with mean length 23 cm up to a maximal length of 80 cm take up a significant proportion of the total paths. Thus, rat paths are biased as compared to random exploration. Next we designed a RL system that reproduces these specific path characteristics. Our model arena is covered by overlapping, probabilistically firing place fields (PF) of realistic size and coverage. Because convergence of RL-algorithms is also influenced by the state space characteristics, different PF-sizes and densities, leading to a different degree of overlap, were also investigated. The model rat learns finding a reward opposite to its starting point. We observed that the combination of biased straight exploration, overlapping coverage and probabilistic firing will strongly impair the convergence of learning. When the degree of randomness in the exploration is increased, convergence improves, but the distribution of straight path segments becomes unrealistic and paths become 'wiggly'. To mend this situation without affecting the path characteristic two additional mechanisms are implemented: A gradual drop of the learned weights (weight decay) and path length limitation, which prevents learning if the reward is not found after some expected time. Both mechanisms limit the memory of the system and thereby counteract effects of getting trapped on a wrong path. When using these strategies individually divergent cases get substantially reduced and for some parameter settings no divergence was found anymore at all. Using weight decay and path length limitation at the same time, convergence is not much improved but instead time to convergence increases as the memory limiting effect is getting too strong. The degree of improvement relies also on the size and degree of overlap (coverage density) in the place field system. The used combination of these two parameters leads to a trade-off between convergence and speed to convergence. Thus, this study suggests that the role of the PF-system in navigation learning cannot be considered independently from the animals' exploration pattern.

• Item Type: Articles
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Porr, Dr Bernd
• Authors: Tamosiunaite, M., Ainge, J., Kulvicius, T., Porr, B., Dudchenko, P., and Worgotter, F.
• College/School: College of Science and Engineering > School of Engineering > Biomedical Engineering
• Journal Name: Journal of Computational Neuroscience
• Publisher: Springer Verlag
• ISSN: 0929-5313
• ISSN (Online): 1573-6873
• Published Online: 30 April 2008
• Copyright Holders: Copyright © 2008 The Authors
• First Published: First published in Journal of Computational Neuroscience 25(3):562-582
• Publisher Policy: Reproduced under a Creative Commons License