Cited by 68Reinforcement Learning in RoboticsMemory and Neural MechanismsEmbodied and Extended Cognition

Balancing new against old information: the role of puzzlement surprise in learning

Open access
Faraji, Mohammadjavad, Preuschoff, Kerstin, Gerstner, Wulfram·2018·Neural Computation

Abstract

Surprise describes a range of phenomena from unexpected events to behavioral responses. We propose a novel measure of surprise and use it for surprise-driven learning. Our surprise measure takes into account data likelihood as well as the degree of commitment to a belief via the entropy of the belief distribution. We find that surprise-minimizing learning dynamically adjusts the balance between new and old information without the need of knowledge about the temporal statistics of the environment. We apply our framework to a dynamic decision-making task and a maze exploration task. Our surprise-minimizing framework is suitable for learning in complex environments, even if the environment undergoes gradual or sudden changes, and it could eventually provide a framework to study the behavior of humans and animals as they encounter surprising events.

Integrity signals

Registry

Crossref · 10.1162/neco_a_01025

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Deviations from expected uncertainty should increase learning rates.

    “Here, deviations from expected uncertainty (“unexpected uncertainty”) should increase learning rates.8,12,13,15–18”

    From Serotonin neurons modulate learning rate through uncertainty (2022) · cites this paper as [18]

The citation lists haven’t been fetched yet

References 115 · Cited by 68

Authors
Faraji, M., Preuschoff, K., & Gerstner, W.
Affiliations
  • École Polytechnique Fédérale de Lausanne (CH)
  • University of Geneva (CH)
Corresponding author
  • Faraji, Mohammadjavad
  • Preuschoff, Kerstin
  • Gerstner, Wulfram
Venue
Neural Computation
Published
2018-01
Volume
30
Issue
1
Pages
34-83
ISSN
  • 0899-7667 (ISSN-L)
  • 1530-888X
OpenAlex
W2766414154
Cited by
68
References
115
Citations by year
2026: 2 · 2025: 5 · 2024: 7 · 2023: 6 · 2022: 12 · 2021: 10 · 2020: 17 · 2019: 5 · 2018: 4
FWCI
4.24
Type
journal article
Language
en
Open access
Licence
cc-by-nc-nd
Locations
  • Neural Computation (publishedVersion)
  • PubMed (publishedVersion)
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion, cc-by-nc-nd)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Life Sciences › Neuroscience › Cognitive Neuroscience › Memory and Neural Mechanisms
  • Life Sciences › Neuroscience › Cognitive Neuroscience › Embodied and Extended Cognition
Keywords
surprise, belief updating, belief entropy, dynamic decision making, maze exploration, environmental change, temporal statistics, Bayesian learning
MeSH terms
Adaptation, Psychological, Algorithms, Decision Making, Environment, Female, Humans, Learning, Male, Models, Neurological, Neurons

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review