Evidence map›Paper›PMID 36944240›Full record

ArticleNeural computation2023

Reward Maximization Through Discrete Active Inference.

Lancelot Da Costa, Noor Sajid, Thomas Parr, Karl Friston, Ryan Smith

Abstract read
In one paragraph

Article in Neural computation, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 10 papers.

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

10 citing papers in PubMed.

  1. Review
  2. Article
  3. Review
  4. Gradient-Free De Novo Learning.Entropy (Basel, Switzerland) · 2025
    Article
  5. Article
  6. Article
  7. Article
  8. Review
  9. Article
  10. 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

5 authors.

Lancelot Da CostaDepartment of Mathematics, Imperial College London, London SW7 2AZ, U.K. l.da-costa@imperial.ac.uk.
Noor SajidWellcome Centre for Human Neuroimaging, University College London, London, WC1N 3AR, U.K. noor.sajid.18@ucl.ac.uk.
Thomas ParrWellcome Centre for Human Neuroimaging, University College London, London, WC1N 3AR, U.K. thomas.parr.12@ucl.ac.uk.
Karl FristonWellcome Centre for Human Neuroimaging, University College London, London, WC1N 3AR, U.K. k.friston@ucl.ac.uk.
Ryan SmithLaureate Institute for Brain Research, Tulsa, OK 74136, U.S.A. rsmith@laureateinstitute.org.

Funding

The Center for Neuroscience-based Mental Health Assessment and Prediction (NEUROMAP)P20GM121312 · NIGMS · LAUREATE INSTITUTE FOR BRAIN RESEARCH · PI MARTIN P. PAULUS · 2017 to 2026
$23.7M
An Approach-Avoidance, Computational Framework for Predicting Behavioral Therapy Outcome in Anxiety and DepressionR01MH123691 · NIMH · LAUREATE INSTITUTE FOR BRAIN RESEARCH · PI AUPPERLE, ROBIN L · 2020 to 2024
$2.6M
Medical Research Council MR/S502522/1NIGMS NIH HHS P20 GM121312NIMH NIH HHS R01 MH123691Wellcome TrustWellcome Trust 205103/Z/16/Z
6 · The paper itself

Abstract

Active inference is a probabilistic framework for modeling the behavior of biological and artificial agents, which derives from the principle of minimizing free energy. In recent years, this framework has been applied successfully to a variety of situations where the goal was to maximize reward, often offering comparable and sometimes superior performance to alternative approaches. In this article, we clarify the connection between reward maximization and active inference by demonstrating how and when active inference agents execute actions that are optimal for maximizing reward. Precisely, we show the conditions under which active inference produces the optimal solution to the Bellman equation, a formulation that underlies several approaches to model-based reinforcement learning and control. On partially observed Markov decision processes, the standard active inference scheme can produce Bellman optimal actions for planning horizons of 1 but not beyond. In contrast, a recently developed recursive active inference scheme (sophisticated inference) can produce Bellman optimal actions on any finite temporal horizon. We append the analysis with a discussion of the broader relationship between active inference and reinforcement learning.

Indexed as

Choice BehaviorLearningReward

Identifiers

PMID36944240
PMCPMC12697526

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.