Evidence map›Paper›PMID 34845010›Full record

ArticleProceedings of the National Academy of Sciences of the United States of America2021

Compensatory variability in network parameters enhances memory performance in the

Nada Y Abdelrahman, Eleni Vasilaki, Andrew C Lin

Abstract read
In one paragraph

Article in Proceedings of the National Academy of Sciences of the United States of America, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 papers.

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

7 citing papers in PubMed.

  1. Article
  2. Article
  3. Review
  4. Article
  5. Article
  6. Article
  7. 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

3 authors.

Nada Y AbdelrahmanSchool of Biosciences, University of Sheffield, Sheffield S10 2TN, United Kingdom.ORCID 0000-0003-3198-3225
Eleni VasilakiDepartment of Computer Science, University of Sheffield, Sheffield S1 4DP, United Kingdom.
Andrew C LinSchool of Biosciences, University of Sheffield, Sheffield S10 2TN, United Kingdom; andrew.lin@sheffield.ac.uk.ORCID 0000-0001-6310-9765

Funding

Biotechnology and Biological Sciences Research Council BB/S016031/1
6 · The paper itself

Abstract

Neural circuits use homeostatic compensation to achieve consistent behavior despite variability in underlying intrinsic and network parameters. However, it remains unclear how compensation regulates variability across a population of the same type of neurons within an individual and what computational benefits might result from such compensation. We address these questions in the Drosophila mushroom body, the fly's olfactory memory center. In a computational model, we show that under sparse coding conditions, memory performance is degraded when the mushroom body's principal neurons, Kenyon cells (KCs), vary realistically in key parameters governing their excitability. However, memory performance is rescued while maintaining realistic variability if parameters compensate for each other to equalize KC average activity. Such compensation can be achieved through both activity-dependent and activity-independent mechanisms. Finally, we show that correlations predicted by our model's compensatory mechanisms appear in the Drosophila hemibrain connectome. These findings reveal compensatory variability in the mushroom body and describe its computational benefits for associative memory.

Indexed as

AnimalsBehavior, AnimalComputer SimulationDrosophila melanogasterMemoryMushroom BodiesNerve NetNeuronsOdorantsassociative memoryDrosophilahomeostatic plasticitymushroom body

Identifiers

PMID34845010
PMCPMC8670477

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.