PacMouse: Mice solve hidden abstract graph traversal problems in freely-moving virtual reality

Matthew Rosenberg, Zac Levy, David W. Tank

TL;DR: Mice traverse hidden latent graphs via freely moving virtual reality.

Abstract: Biological agents such as mice solve navigation problems in uncertain and partially observable environments. We introduce PacMouse, a rodent behavioral paradigm that elicits exploration of latent graphs while minimizing confounding internal and external cues that could trivialize state estimation. The task is implemented through a freely-moving virtual reality mouse experiment paradigm, in which all decisions occur at a single physical junction with motorized gates controlling access to four radial arms. Proximity sensors in the radial arms trigger virtual transitions between adjacent nodes in a hidden latent graph. This design precludes reliance on path integration or landmark signals, enabling direct comparison between animal behavior and simulated agents. We show that mice frequently outperform a range of baseline policies. The framework provides open-source tools for linking mouse behavioral data to standard RL implementations, establishing a common task in which to benchmark head-to-head biological and artificial decision making.

Length: long paper (up to 8 pages)

Domain: data, methods

Author List Check: The author list is correctly ordered and I understand that additions and removals will not be allowed after the abstract submission deadline.

Anonymization Check: This submission has been anonymized for double-blind review via the removal of identifying information such as names, affiliations, and URLs that point to identifying information.

Submission Number: 70