Evidence map›Paper›PMID 42869989›Full record

ReviewCommunications psychology2026

Natural and engineered safe reinforcement learning.

Pranav Mahajan, Ben Seymour

Abstract readReview
In one paragraph

Review in Communications psychology, 2026. 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

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

2 authors.

Pranav MahajanOxford Centre for Integrative Neuroimaging, FMRIB, Nuffield Department of Clinical Neurosciences, University of Oxford, Oxford, UK. pranav.mahajan@ndcn.ox.ac.uk.ORCID http://orcid.org/0009-0001-2507-5450
Ben SeymourOxford Centre for Integrative Neuroimaging, FMRIB, Nuffield Department of Clinical Neurosciences, University of Oxford, Oxford, UK.

Funding

Japan Society for the Promotion of Science London (JSPS London) 22H04998MSIP | Institute for Information and communications Technology Promotion (Institute for Information & communications Technology Promotion) MSIT 426 2019-0-01371Wellcome TrustWellcome Trust (Wellcome) 203139/A/16/ZWellcome Trust (Wellcome) 203139/Z/16/ZWellcome Trust (Wellcome) 214251/Z/18/Z
6 · The paper itself

Abstract

Survival depends not only on maximising rewards but on minimising harm. While Reinforcement Learning (RL) provides a normative framework for adaptive decision-making, standard algorithms often fail to account for the catastrophic costs of errors during learning, in the same way as animals do. In this review, we synthesise recent advances connecting the engineering of safe RL with behavioural and systems neuroscience. We adopt a principled taxonomy distinguishing between two strategies: (1) modifying the optimisation criterion to embed safety into the learning objective, and (2) modifying the exploration process to prevent dangerous actions. We show that engineering solutions, such as worst-case optimisation, risk-sensitive objectives (e.g., conditional value at risk, CVaR), and constrained Markov decision processes (MDPs), offer precise computational accounts for anxiety, risk-aversion, and defensive reflexes. Conversely, biological mechanisms, including innate priors, interoception, and meta-control based on uncertainty, reliability and competing needs, offer robust solutions to the problem of safe exploration in artificial agents. By bridging these domains, we highlight a converging computational landscape where safety is achieved through a dynamic interplay between reactive instincts and deliberative planning.

Identifiers

PMID42869989
PMCPMC13661269

What OpenQuestion holds

Textmetadata
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.