Cited by 33Visual perception and processing mechanismsNeural dynamics and brain functionNeural Networks and Applications

Reinforcement learning of linking and tracing contours in recurrent neural networks

Open access
Brosch, Tobias, Neumann, Heiko, Roelfsema, Pieter R.·2015·PLoS Computational Biology

Abstract

The processing of a visual stimulus can be subdivided into a number of stages. Upon stimulus presentation there is an early phase of feedforward processing where the visual information is propagated from lower to higher visual areas for the extraction of basic and complex stimulus features. This is followed by a later phase where horizontal connections within areas and feedback connections from higher areas back to lower areas come into play. In this later phase, image elements that are behaviorally relevant are grouped by Gestalt grouping rules and are labeled in the cortex with enhanced neuronal activity (object-based attention in psychology). Recent neurophysiological studies revealed that reward-based learning influences these recurrent grouping processes, but it is not well understood how rewards train recurrent circuits for perceptual organization. This paper examines the mechanisms for reward-based learning of new grouping rules. We derive a learning rule that can explain how rewards influence the information flow through feedforward, horizontal and feedback connections. We illustrate the efficiency with two tasks that have been used to study the neuronal correlates of perceptual organization in early visual cortex. The first task is called contour-integration and demands the integration of collinear contour elements into an elongated curve. We show how reward-based learning causes an enhancement of the representation of the to-be-grouped elements at early levels of a recurrent neural network, just as is observed in the visual cortex of monkeys. The second task is curve-tracing where the aim is to determine the endpoint of an elongated curve composed of connected image elements. If trained with the new learning rule, neural networks learn to propagate enhanced activity over the curve, in accordance with neurophysiological data. We close the paper with a number of model predictions that can be tested in future neurophysiological and computational studies.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1371/journal.pcbi.1004489

Cites

150 of 150 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • For networks with more than three layers, this gives rise to a model based on columns containing parallel feedforward and feedback pathways, and for recurrent networks that settle into attractor states it gives a reinforcement-trained version of the Almeida/Pineda recurrent backpropagation algorithm.

    “For networks with more than three layers, this gives rise to a model based on columns containing parallel feedforward and feedback pathways (Roelfsema and van Ooyen, 2005), and for recurrent networks that settle into attractor states it gives a reinforcement-trained version (Brosch et al., 2015) of the Almeida/Pineda recurrent backpropagation algorithm (Pineda, 1987).”

    From Toward an integration of deep learning and neuroscience (2016) · cites this paper as Brosch et al., 2015

  • The AGREL networks and variants like KickBack give a way to compute an approximation to the full gradient in a reinforcement learning context using a feedback-based attention mechanism for credit assignment within the multi-layer network.

    “The “attention-gated reinforcement learning” (AGREL) networks of Stanisor et al. (2013), Brosch et al. (2015), and Roelfsema and van Ooyen (2005), and variants like KickBack (Balduzzi, 2014), give a way to compute an approximation to the full gradient in a reinforcement learning context using a feedback-based attention mechanism for credit assignment within the multi-layer network.”

    From Toward an integration of deep learning and neuroscience (2016) · cites this paper as Brosch et al., 2015

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. [115]O’Reilly RC, Munakata Y (2000) Computational Explorations in Cognitive Neuroscience: Understanding the Mind by Simulating the Brain. Cambridge, Mass, USA: MIT Press.
  2. [121]Steil JJ (2004) Backpropagation–Decorrelation: Online Recurrent Learning with O(N) Complexity In: IJCNN. IEEE, volume 2, pp. 843– 8.

Cited by

Sorted by citations

Authors
Brosch, T., Neumann, H., & Roelfsema, P. R.
Affiliations
  • Universität Ulm (DE)
  • Netherlands Institute for Neuroscience (NL)
Corresponding author
  • Brosch, Tobias
  • Roelfsema, Pieter R.
Venue
PLoS Computational Biology
Published
2015-10-23
Volume
11
Issue
10
Pages
e1004489
ISSN
  • 1553-734X (ISSN-L)
  • 1553-7358
OpenAlex
W2138332780
Cited by
33
References
150
Citations by year
2026: 2 · 2025: 4 · 2024: 4 · 2023: 1 · 2022: 2 · 2020: 2 · 2019: 5 · 2018: 4 · 2017: 2 · 2016: 7
FWCI
2.61
Type
journal article
Language
en
Open access
Locations
  • PLoS Computational Biology (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • KNAW research portal (Royal Academy of Art and Sciences (KNAW)) (publishedVersion, other-oa)
  • VU Research Portal (publishedVersion, other-oa)
  • Data Archiving and Networked Services (DANS) (submittedVersion)
  • Data Archiving and Networked Services (DANS) (submittedVersion, other-oa)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Pure Amsterdam UMC (submittedVersion, other-oa)
Funders
  • European Commission (604102, 339490, 2007–2013, FP7 2007-2013, FP7/2007, 290011)
  • Deutsche Forschungsgemeinschaft (FP7/2007–2013)
  • Universität Ulm
  • FP7 Ideas: European Research Council (339490)
Topics
  • Life Sciences › Neuroscience › Cognitive Neuroscience › Visual perception and processing mechanisms
  • Life Sciences › Neuroscience › Cognitive Neuroscience › Neural dynamics and brain function
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
Keywords
reward learning, perceptual organization, Gestalt grouping, contour integration, curve tracing, recurrent neural networks, feedback connections, object-based attention, early visual cortex
MeSH terms
Animals, Computer Simulation, Macaca, Memory, Models, Neurological, Nerve Net, Reinforcement, Psychology, Visual Cortex, Visual Perception, Feedback, Physiological

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