Evidence map›Paper›PMID 38106232›Full record

ArticlebioRxiv : the preprint server for biology2023

Adaptive algorithms for shaping behavior.

William L Tong, Anisha Iyer, Venkatesh N Murthy, Gautam Reddy

Abstract readPreprint
In one paragraph

Article in bioRxiv : the preprint server for biology, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing 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

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

5 · Who and what money

Authors and funding

4 authors.

William L TongSchool of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA.
Anisha IyerUniversity of California Berkeley, CA, USA.
Venkatesh N MurthyDepartment of Molecular and Cellular Biology, Harvard University, Cambridge, MA, USA and Center for Brain Science, Harvard University, Cambridge, MA, USA.ORCID 0000-0003-2443-4252
Gautam ReddyPhysics & Informatics Laboratories, NTT Research, Inc., Sunnyvale, CA, USA and Center for Brain Science, Harvard University, Cambridge, MA, USA.ORCID 0000-0002-1276-9613

Funding

Stability and flexibility of neural representations in the ventral striatumR01DC017311 · NIDCD · HARVARD UNIVERSITY · PI VENKATESH N MURTHY, Naoshige Uchida · 2019 to 2026
$4.5M
Odor trail tracking: a new paradigm to unveil algorithms and neural circuits underlying active sensation and continuous decision makingRF1NS128865 · NINDS · HARVARD UNIVERSITY · PI DULAC, CATHERINE, MURTHY, VENKATESH N · 2022 to 2022
$2.7M
NIDCD NIH HHS R01 DC017311NINDS NIH HHS RF1 NS128865
6 · The paper itself

Abstract

Dogs and laboratory mice are commonly trained to perform complex tasks by guiding them through a curriculum of simpler tasks ('shaping'). What are the principles behind effective shaping strategies? Here, we propose a machine learning framework for shaping animal behavior, where an autonomous teacher agent decides its student's task based on the student's transcript of successes and failures on previously assigned tasks. Using autonomous teachers that plan a curriculum in a common sequence learning task, we show that near-optimal shaping algorithms adaptively alternate between simpler and harder tasks to carefully balance reinforcement and extinction. Based on this intuition, we derive an adaptive shaping heuristic with minimal parameters, which we show is near-optimal on the sequence learning task and robustly trains deep reinforcement learning agents on navigation tasks that involve sparse, delayed rewards. Extensions to continuous curricula are explored. Our work provides a starting point towards a general computational framework for shaping animal behavior.

Identifiers

PMID38106232
PMCPMC10723287

What OpenQuestion holds

Textmetadata
LicenceCC BY-ND
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.