Evidence map›Paper›PMID 30764739›Full record

ArticleNeural computation2019

Estimating Scale-Invariant Future in Continuous Time.

Zoran Tiganj, Samuel J Gershman, Per B Sederberg, Marc W Howard

Abstract read
In one paragraph

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

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

14 citing papers in PubMed.

  1. Time-Local Transformer.Computational brain & behavior · 2026
    Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Scanning a compressed ordered representation of the future.Journal of experimental psychology. General · 2022
    Article
  9. Article
  10. Article
  11. Neural circuits and symbolic processing.Neurobiology of learning and memory · 2021
    Review
  12. A temporal record of the past with a spectrum of time constants in the monkey entorhinal cortex.Proceedings of the National Academy of Sciences of the United States of America · 2020
    Article
  13. Article
  14. 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

4 authors.

Zoran TiganjCenter for Memory and Brain, Department of Psychological and Brain Sciences, Boston, MA 02215, U.S.A. zoran.tiganj@gmail.com.
Samuel J GershmanDepartment of Psychology and Center for Brain Science, Harvard University, Cambridge, MA 02138, U.S.A. gershman@fas.harvard.edu.
Per B SederbergDepartment of Psychology, University of Virginia, Charlottesville, VA, 22904, U.S.A. pbs5u@virginia.edu.
Marc W HowardCenter for Memory and Brain, Department of Psychological and Brain Sciences, Boston, MA 02215, U.S.A. marc777@bu.edu.

Funding

CRCNS:Navigation Through A Memory Space in the Rodent HippocampusR01MH112169 · NIMH · BOSTON UNIVERSITY (CHARLES RIVER CAMPUS) · PI HOWARD, MARC W · 2016 to 2018
$1.0M
Toward a Theory for Macroscopic Neural Computation Based on Laplace TransformR01EB022864 · NIBIB · BOSTON UNIVERSITY (CHARLES RIVER CAMPUS) · PI HOWARD, MARC W · 2016 to 2018
$988k
NIBIB NIH HHS R01 EB022864NIH HHS R01- 1207833NIH HHS R01EB022864NIH HHS R01MH112169NIMH NIH HHS R01 MH112169
6 · The paper itself

Abstract

Natural learners must compute an estimate of future outcomes that follow from a stimulus in continuous time. Widely used reinforcement learning algorithms discretize continuous time and estimate either transition functions from one step to the next (model-based algorithms) or a scalar value of exponentially discounted future reward using the Bellman equation (model-free algorithms). An important drawback of model-based algorithms is that computational cost grows linearly with the amount of time to be simulated. An important drawback of model-free algorithms is the need to select a timescale required for exponential discounting. We present a computational mechanism, developed based on work in psychology and neuroscience, for computing a scale-invariant timeline of future outcomes. This mechanism efficiently computes an estimate of inputs as a function of future time on a logarithmically compressed scale and can be used to generate a scale-invariant power-law-discounted estimate of expected future reward. The representation of future time retains information about what will happen when. The entire timeline can be constructed in a single parallel operation that generates concrete behavioral and neural predictions. This computational mechanism could be incorporated into future reinforcement learning algorithms.

Indexed as

Machine LearningAnimalsAnticipation, PsychologicalBrainComputer SimulationDecision MakingHumansMemoryModels, NeurologicalModels, PsychologicalReinforcement, PsychologyTimeTime Perception

Identifiers

PMID30764739
PMCPMC6959535

What OpenQuestion holds

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