Fundamental bound on the persistence and capacity of short-term memory stored as graded persistent activity

  1. Onur Ozan Koyluoglu  Is a corresponding author
  2. Yoni Pertzov
  3. Sanjay Manohar
  4. Masud Husain
  5. Ila R Fiete
  1. University of California, United States
  2. Hebrew University of Jerusalem, Israel
  3. University of Oxford, United Kingdom
  4. The University of Texas at Austin, United States

Abstract

It is widely believed that persistent neural activity underlies short-term memory. Yet, as we show, temporal degradation in such networks behaves differently from human short-term memory performance. We build a more general framework where the memory is viewed as a problem of passing information through noisy channels that represent analog persistent activity networks. Rather than directly storing information, such memory networks might hold information encoded to achieve robustness against noise. We derive a fundamental lower-bound on memory recall precision, which declines with storage duration and number of stored items. We show that human performance, though inconsistent with models involving direct (uncoded) storage in persistent activity networks, can be well-fit by the theoretical bound. This finding is consistent with the view that if the brain stores information in patterns of persistent activity, it might use codes that minimize the effects of noise, motivating the search for such codes in the brain.

Article and author information

Author details

  1. Onur Ozan Koyluoglu

    Department of Electrical and Computer Science, University of California, Berkeley, United States
    For correspondence
    ozan.koyluoglu@berkeley.edu
    Competing interests
    The authors declare that no competing interests exist.
    ORCID icon "This ORCID iD identifies the author of this article:" 0000-0001-8512-4755
  2. Yoni Pertzov

    Department of Psychology, Hebrew University of Jerusalem, Jerusalem, Israel
    Competing interests
    The authors declare that no competing interests exist.
  3. Sanjay Manohar

    Department of Experimental Psychology, University of Oxford, Oxford, United Kingdom
    Competing interests
    The authors declare that no competing interests exist.
    ORCID icon "This ORCID iD identifies the author of this article:" 0000-0003-0735-4349
  4. Masud Husain

    Department of Experimental Psychology, University of Oxford, Oxford, United Kingdom
    Competing interests
    The authors declare that no competing interests exist.
  5. Ila R Fiete

    Center for Learning and Memory, The University of Texas at Austin, Austin, United States
    Competing interests
    The authors declare that no competing interests exist.

Funding

National Science Foundation (IIS-1464349)

  • Onur Ozan Koyluoglu

Israeli Science Foundation (1747/14)

  • Yoni Pertzov

National Institute for Health Research (Oxford Biomedical Centre)

  • Masud Husain

Wellcome Trust

  • Masud Husain

National Science Foundation (IIS-1148973)

  • Ila R Fiete

Simons Foundation

  • Ila R Fiete

Howard Hughes Medical Institute (Faculty Scholar Award)

  • Ila R Fiete

MRC Clinician Scientist Fellowship (MR/P00878X)

  • Sanjay Manohar

The funders had no role in study design, data collection and interpretation, or the decision to submit the work for publication.

Reviewing Editor

  1. Lila Davachi, New York University, United States

Ethics

Human subjects: The study reported here conform to the Declaration of Helsinki and all procedures were approved by the ethics committee of the National Hospital for Neurology and Neurosurgery (NHNN) prior to the study commencing. Research Ethics Committee number (ERC) 04/Q0406/60. Personal information about individuals was password protected and saved in compliance to the Data Protection Act 1998 (DPA).

Version history

  1. Received: October 8, 2016
  2. Accepted: August 25, 2017
  3. Accepted Manuscript published: September 7, 2017 (version 1)
  4. Version of Record published: September 20, 2017 (version 2)

Copyright

© 2017, Koyluoglu et al.

This article is distributed under the terms of the Creative Commons Attribution License permitting unrestricted use and redistribution provided that the original author and source are credited.

Metrics

  • 2,471
    views
  • 389
    downloads
  • 24
    citations

Views, downloads and citations are aggregated across all versions of this paper published by eLife.

Download links

A two-part list of links to download the article, or parts of the article, in various formats.

Downloads (link to download the article as PDF)

Open citations (links to open the citations from this article in various online reference manager services)

Cite this article (links to download the citations from this article in formats compatible with various reference manager tools)

  1. Onur Ozan Koyluoglu
  2. Yoni Pertzov
  3. Sanjay Manohar
  4. Masud Husain
  5. Ila R Fiete
(2017)
Fundamental bound on the persistence and capacity of short-term memory stored as graded persistent activity
eLife 6:e22225.
https://doi.org/10.7554/eLife.22225

Share this article

https://doi.org/10.7554/eLife.22225

Further reading

    1. Computational and Systems Biology
    2. Genetics and Genomics
    Weichen Song, Yongyong Shi, Guan Ning Lin
    Tools and Resources

    We propose a new framework for human genetic association studies: at each locus, a deep learning model (in this study, Sei) is used to calculate the functional genomic activity score for two haplotypes per individual. This score, defined as the Haplotype Function Score (HFS), replaces the original genotype in association studies. Applying the HFS framework to 14 complex traits in the UK Biobank, we identified 3619 independent HFS–trait associations with a significance of p < 5 × 10−8. Fine-mapping revealed 2699 causal associations, corresponding to a median increase of 63 causal findings per trait compared with single-nucleotide polymorphism (SNP)-based analysis. HFS-based enrichment analysis uncovered 727 pathway–trait associations and 153 tissue–trait associations with strong biological interpretability, including ‘circadian pathway-chronotype’ and ‘arachidonic acid-intelligence’. Lastly, we applied least absolute shrinkage and selection operator (LASSO) regression to integrate HFS prediction score with SNP-based polygenic risk scores, which showed an improvement of 16.1–39.8% in cross-ancestry polygenic prediction. We concluded that HFS is a promising strategy for understanding the genetic basis of human complex traits.

    1. Computational and Systems Biology
    Qianmu Yuan, Chong Tian, Yuedong Yang
    Tools and Resources

    Revealing protein binding sites with other molecules, such as nucleic acids, peptides, or small ligands, sheds light on disease mechanism elucidation and novel drug design. With the explosive growth of proteins in sequence databases, how to accurately and efficiently identify these binding sites from sequences becomes essential. However, current methods mostly rely on expensive multiple sequence alignments or experimental protein structures, limiting their genome-scale applications. Besides, these methods haven’t fully explored the geometry of the protein structures. Here, we propose GPSite, a multi-task network for simultaneously predicting binding residues of DNA, RNA, peptide, protein, ATP, HEM, and metal ions on proteins. GPSite was trained on informative sequence embeddings and predicted structures from protein language models, while comprehensively extracting residual and relational geometric contexts in an end-to-end manner. Experiments demonstrate that GPSite substantially surpasses state-of-the-art sequence-based and structure-based approaches on various benchmark datasets, even when the structures are not well-predicted. The low computational cost of GPSite enables rapid genome-scale binding residue annotations for over 568,000 sequences, providing opportunities to unveil unexplored associations of binding sites with molecular functions, biological processes, and genetic variants. The GPSite webserver and annotation database can be freely accessed at https://bio-web1.nscc-gz.cn/app/GPSite.