Mice in a labyrinth show rapid learning, sudden insight, and efficient exploration

Matthew Rosenberg, Tony Zhang, Pietro Perona, Markus Meister

TL;DR

Mice can learn complex navigation tasks in a labyrinth with remarkable speed and efficiency, exhibiting rapid learning and "sudden insight" after very few rewards. Their exploration strategy is surprisingly efficient and relies on simple, local turning rules rather than a global memory of the maze.

What Problem Does This Paper Address?

Many contemporary studies on animal learning, particularly those using two-alternative-forced-choice (2AFC) tasks, show slow and incomplete learning, often requiring thousands of trials over weeks. This raises questions about the ecological relevance of these tasks and whether they truly reflect how animals learn in naturalistic environments. The authors aim to investigate learning and exploration in a more complex, unconstrained setting, seeking to understand the behavioral algorithms that support rapid, few-shot learning and efficient navigation. They propose that a complex labyrinth, offering many decision points and a naturalistic environment, is a better substrate for studying these phenomena.

Methods

The researchers designed a complex, 6-level binary tree labyrinth with 63 T-junctions and 64 endpoints, one of which dispensed a water reward. Mice were given free access to the maze for one night without any human handling, shaping, or training. Their movements were continuously recorded using infrared cameras and analyzed using automated tracking software (DeepLabCut) to identify key points on the animal's body. The raw trajectory data was then processed into a "node sequence," representing the animal's passage through the maze's decision points.

To analyze learning, they tracked the number of rewards and the length of "water runs" (direct paths to the reward). To investigate the role of external cues, they performed maze rotations. To understand exploration efficiency, they analyzed the number of unique end nodes visited as a function of total nodes visited. Finally, they developed and tested various computational models (fixed-depth and variable-depth Markov chains, biased random walks) to predict mouse decisions based on their recent history.

Datasets

The study utilized data collected from 20 mice (10 water-deprived, 10 sated) over a 7-hour period each. This generated a rich dataset of approximately 15,000 decisions per animal. The authors also created a simulated "biased random walk" dataset for comparison with their models. The raw behavioral data and code are publicly available in a GitHub repository and a permanent institutional repository.

Key Insights and Ideas

  • Rapid, Few-Shot Learning: Mice can learn to navigate to a reward in a complex maze with remarkable speed, achieving near-perfect performance after only about 10 reward experiences. This is orders of magnitude faster than typical 2AFC tasks.
  • Sudden Insight: Learning doesn't always appear gradual. Many mice showed discontinuous jumps in their performance, suggesting moments of "sudden insight" about the maze's structure.
  • Efficient Exploration: Mice explore the maze efficiently, avoiding re-entering previously visited areas much better than a random walk. This efficiency is achieved without requiring a global memory of the maze.
  • Local Rules Drive Behavior: The efficient exploration and navigation appear to be governed by simple, local turning rules at T-junctions, rather than a complex internal map. These rules are remarkably consistent across individual mice.
  • Exploration as a Dominant Mode: Even after learning the reward location, mice continue to spend a significant amount of time exploring the maze, suggesting an intrinsic drive for exploration.

Key Results

  • Water-deprived mice learned to navigate to the water port in fewer than 2000 seconds and fewer than 17 bouts.
  • After ~10 reward experiences, mice consistently took "perfect paths" to the water port, requiring six correct decisions.
  • The efficiency of exploration, measured as how quickly mice discovered new end nodes, was about half that of an optimal agent but twice that of a random walker.
  • The animals' turning biases at T-junctions explained about 87% of their exploration efficiency.
  • Models predicting mouse decisions based on history achieved a cross-entropy of ~1.24 bits/action, significantly reducing uncertainty compared to a random guess (1.585 bits/action).

Limitations and Future Work

The authors acknowledge that their current models do not fully explain the observed efficiency of exploration, suggesting that some components of efficient search remain to be understood. They also note that while their models can predict mouse behavior with significant accuracy, a small amount of uncertainty remains, which they playfully refer to as potentially representing "free will."

Future work could involve:

  • Investigating the neural mechanisms underlying this rapid, discontinuous learning.
  • Exploring how different types of knowledge (e.g., target location vs. efficient routes) are acquired and integrated.
  • Designing more complex tasks to further challenge the animals' learning and navigation abilities.
  • Developing more sophisticated models to further reduce the prediction uncertainty and better understand the underlying algorithms.
  • Testing the generality of these findings across different species and genetic backgrounds.

Summary updated

Abstract

Animals learn certain complex tasks remarkably fast, sometimes after a single experience. What behavioral algorithms support this efficiency? Many contemporary studies based on two-alternative-forced-choice (2AFC) tasks observe only slow or incomplete learning. As an alternative, we study the unconstrained behavior of mice in a complex labyrinth and measure the dynamics of learning and the behaviors that enable it. A mouse in the labyrinth makes ~2000 navigation decisions per hour. The animal explores the maze, quickly discovers the location of a reward, and executes correct 10-bit choices after only 10 reward experiences - a learning rate 1000-fold higher than in 2AFC experiments. Many mice improve discontinuously from one minute to the next, suggesting moments of sudden insight about the structure of the labyrinth. The underlying search algorithm does not require a global memory of places visited and is largely explained by purely local turning rules.
BibTeX
@inproceedings{rosenberg2021mice,
  author = {Matthew Rosenberg and Tony Zhang and Pietro Perona and Markus Meister},
  title = {{Mice in a labyrinth show rapid learning, sudden insight, and efficient exploration}},
  booktitle = {eLife},
  year = {2021},
  doi = {10.7554/elife.66175},
}

Loading related content...

Figure