Evidence map›Paper›PMID 33306669›Full record

ArticlePLoS computational biology2020

Value-complexity tradeoff explains mouse navigational learning.

Nadav Amir, Reut Suliman-Lavie, Maayan Tal, Sagiv Shifman, Naftali Tishby, Israel Nelken

Abstract read
In one paragraph

Article in PLoS computational biology, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 6 papers.

0numbers the graph read from it
0cells of the map it votes in
6citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

6 citing papers in PubMed.

  1. Article
  2. Article
  3. Bayesian Reinforcement Learning With Limited Cognitive Load.Open mind : discoveries in cognitive science · 2024
    Article
  4. Article
  5. Learning, fast and slow.Current opinion in neurobiology · 2022
    Review
  6. Extrinsic rewards, intrinsic rewards, and non-optimal behavior.Journal of computational neuroscience · 2022
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors.

Nadav AmirEdmond and Lily Safra Center for Brain Sciences (ELSC), Hebrew University, Jerusalem, Israel.ORCID 0000-0002-7207-1559
Reut Suliman-LavieThe Alexander Silberman Institute of Life Sciences, Hebrew University, Jerusalem, Israel.ORCID 0000-0002-1728-8114
Maayan TalThe Alexander Silberman Institute of Life Sciences, Hebrew University, Jerusalem, Israel.
Sagiv ShifmanThe Alexander Silberman Institute of Life Sciences, Hebrew University, Jerusalem, Israel.ORCID 0000-0003-4071-5361
Naftali TishbyEdmond and Lily Safra Center for Brain Sciences (ELSC), Hebrew University, Jerusalem, Israel.
Israel NelkenEdmond and Lily Safra Center for Brain Sciences (ELSC), Hebrew University, Jerusalem, Israel.ORCID 0000-0002-6645-107X

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

We introduce a novel methodology for describing animal behavior as a tradeoff between value and complexity, using the Morris Water Maze navigation task as a concrete example. We develop a dynamical system model of the Water Maze navigation task, solve its optimal control under varying complexity constraints, and analyze the learning process in terms of the value and complexity of swimming trajectories. The value of a trajectory is related to its energetic cost and is correlated with swimming time. Complexity is a novel learning metric which measures how unlikely is a trajectory to be generated by a naive animal. Our model is analytically tractable, provides good fit to observed behavior and reveals that the learning process is characterized by early value optimization followed by complexity reduction. Furthermore, complexity sensitively characterizes behavioral differences between mouse strains.

Indexed as

Maze LearningModels, TheoreticalAnimalsMiceReproducibility of ResultsSpecies SpecificitySwimming

Identifiers

PMID33306669
PMCPMC7758052

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.