Population sparseness determines strength of Hebbian plasticity for maximal memory lifetime in associative networks.
Overview
- Institute for Theoretical Biology, Department of Biology, Humboldt-Universität zu Berlin, Berlin, Germany
- Bernstein Center for Computational Neuroscience Berlin, Berlin, Germany
- Department of Physics, Humboldt-Universität zu Berlin, Berlin, Germany
Abstract
The brain can efficiently learn and form memories based on limited exposure to stimuli, often even in single trials. Two key factors are believed to support this ability: large synaptic plasticity to strongly encode new memories; and sparse coding, leading to low overlap between memory representations and to small interference. Therefore, increased sparseness can also improve memory capacity. However, it is not well understood how the strength of plasticity of synapses affects capacity. Here, we analyze the combined impact of population sparseness and strength of plasticity on memory capacity. Specifically, we explore how the strength of plasticity that maximizes capacity depends on the sparseness of the neural code. To this end, we study a feedforward network with Hebbian and homeostatic plasticity and a two-state synapse model. The network learns to associate sparse binary input-output pattern pairs. The strength of plasticity is modeled as the probability of synaptic changes. Our results are based on both network simulations and an analytical theory, predicting the expected memory capacity in dependence on strength of plasticity and population sparseness. For both perfect and noisy input patterns, we find that the optimal strength of plasticity increases with increasing pattern sparseness and that this effect is more pronounced for input than for output sparseness. Interestingly, the optimal strength of plasticity remains the same across different network sizes if the number of active units in an input pattern is constant. While the memory capacity obtained at the optimal strength of plasticity increases monotonically with output sparseness, its dependence on input sparseness is non-monotonic. Overall, we provide the first detailed investigation of the interactions between population sparseness, strength of plasticity, and memory capacity. Our findings suggest that differences in sparseness between brain regions may underlie observed differences in how strongly these regions adapt and how quickly they learn.
Reproduced under the paper's license (CC BY), from the paper cited above.
Code
No file of the authors' code could be read here: it is described below, and read at its source.
itbgit.biologie.hu-berlin.de/auer/sparseness_plasticity_lifetime
Availability: 1 check, the latest on 27 September 2026: the link answers (HTTP 200)
- 27 September 2026: the link answers (HTTP 200)
The paper's code and data availability statement is in the Data section.
Tracing map
Proposed by the machine: these links were found in the paper and verified at the source, without human review. The map will receive a Zenodo DOI once one of the paper's authors has validated it with their ORCID.
What the map holds:
- 1 repository of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
- 0 scripts, each with its path and the digest of its content;
- no match between paragraphs and code yet;
- neither the text of the paper nor the code itself.
Its JSON (tracing-map.json) is deposited on Zenodo with its DOI once the map is validated.
Data
No dataset and no data link were found in the paper.
Data Availability
The code written in support of this publication is publicly available at https://
Reproduced under the paper's license (CC BY), from the paper cited above.
Versions
The history of this record: each version stored by the harvester or made by a correction of its authors or of the maintainers of its code, and what changed in its facts. The texts of the paper (its abstract, its availability statements) are not part of it; versions that changed only those are not listed.
Version 1, 27 September 2026: the first record
Recorded: type, language, journal, volume, issue, pages, dates, 5 authors, 9 MeSH terms, 1 funder, 99 references.
Cite
This paper
Auer, N., Chen, L., Stubenrauch, J., Lindner, B., & Kempter, R. (2026). Population sparseness determines strength of Hebbian plasticity for maximal memory lifetime in associative networks. PLoS computational biology, 22(7), e1013235. https://
BibTeX
@article{auer2026populat
author = {Auer, Naomi and Chen, Lars and Stubenrauch, Jakob and Lindner, Benjamin and Kempter, Richard},
title = {{Population sparseness determines strength of Hebbian plasticity for maximal memory lifetime in associative networks}},
journal = {PLoS computational biology},
year = {2026},
month = jul,
volume = {22},
number = {7},
pages = {e1013235},
publisher = {PLOS},
issn = {1553-734X},
doi = {10.1371/
url = {https://
pmid = {42406841},
pmcid = {PMC13390959}
}
RIS
TY - JOUR
AU - Auer, Naomi
AU - Chen, Lars
AU - Stubenrauch, Jakob
AU - Lindner, Benjamin
AU - Kempter, Richard
TI - Population sparseness determines strength of Hebbian plasticity for maximal memory lifetime in associative networks
T2 - PLoS computational biology
J2 - PLoS Comput Biol
PY - 2026
DA - 2026/
VL - 22
IS - 7
SP - e1013235
SN - 1553-734X
PB - PLOS
DO - 10.1371/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.1371/
"type": "article-journal",
"title": "Population sparseness determines strength of Hebbian plasticity for maximal memory lifetime in associative networks",
"container-title": "PLoS computational biology",
"author": [
{
"family": "Auer",
"given": "Naomi"
},
{
"family": "Chen",
"given": "Lars"
},
{
"family": "Stubenrauch",
"given": "Jakob"
},
{
"family": "Lindner",
"given": "Benjamin"
},
{
"family": "Kempter",
"given": "Richard"
}
],
"container-title-short":
"volume": "22",
"issue": "7",
"page": "e1013235",
"DOI": "10.1371/
"PMID": "42406841",
"PMCID": "PMC13390959",
"ISSN": "1553-734X",
"publisher": "PLOS",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
7,
6
]
]
}
}
The tracing map gets a citation of its own once an author has validated it and it has a DOI.
Similar papers
The papers with a page that share the most with this one: the tools found in their code, their categories, datasets, cited references and authors, the rarest counting most.
- [1] doi:10.1371/journal.pcbi.1009681 [code]
- Hebbian plasticity in parallel synaptic pathways: A circuit mechanism for systems memory consolidation.Journal: PLoS computational biologyIn common: 9 references, author Richard Kempter
- [2] doi:10.1371/journal.pcbi.1011354 [code]
- Attractor neural networks with double well synapses.Journal: PLoS computational biologyIn common: 11 references
- [3] doi:10.1371/journal.pcbi.1011139 [code]
- Rapid memory encoding in a recurrent network model with behavioral time scale synaptic plasticity.Journal: PLoS computational biologyIn common: 8 references
- [4] doi:10.1007/s00422-022-00923-y
- The Impact of Sparse Coding on Memory Lifetimes in Simple and Complex Models of Synaptic Plasticity.Journal: Biological cyberneticsIn common: 8 references
- [5] doi:10.1371/journal.pcbi.1014575 [code]
- Remembering the "when": Hebbian memory models for the time of past events.Journal: PLoS computational biologyIn common: computational modeling (no new data), 7 references
- [6] doi:10.7554/elife.85742 [code]
- Quantitative modeling of the emergence of macroscopic grid-like representations.Journal: eLifeIn common: 2 authors
- [7] doi:10.1038/s41598-022-16407-9
- Stochastic consolidation of lifelong memory.Journal: Scientific reportsIn common: computational modeling (no new data), 6 references
- [8] doi:10.1038/s41467-024-55563-6 [code]
- A simple model for Behavioral Time Scale Synaptic Plasticity (BTSP) provides content addressable memory with binary synapses and one-shot learning.Journal: Nature communicationsIn common: computational modeling (no new data), 6 references
- [9] doi:10.7554/elife.74172 [code]
- The anterior paired lateral neuron normalizes odour-evoked activity in the <i>Drosophila</
i> mushroom body calyx. Journal: eLifeIn common: 6 references - [10] doi:10.3389/fnins.2024.1439414 [code]
- Spiking representation learning for associative memories.Journal: Frontiers in neuroscienceIn common: computational modeling (no new data), 5 references
Contribute
The authors of this paper can claim it, correct its record and validate its tracing map, and the maintainers of its code (its owner, or a public member of its organization) correct what it says of their repository; anyone signed in can ask for its removal. Every request goes to OSCR's own machine, which answers it; your account page follows them.
Sign in with ORCID to claim this paper as one of its authors, correct its record or validate its tracing map: when the paper's metadata lists your ORCID iD, you are recognized at once. Maintainers of its code: sign in with GitHub, then claim the repository on your account page.
Claim this paper
Correct its record
Say what each link of this record is, remove the ones that are not the paper's, add the ones that are missing. The correction becomes a new version of the record, in its Versions section.
Validate its tracing map
You validate the map as this page shows it: 1 repository of the authors' code, each at its verified commit and with its license, 0 scripts, and 0 matches between paragraphs and code (see the Code and Map sections). It then receives a DOI on Zenodo, with you (your ORCID iD) and OSCR as its creators; the code itself is not deposited.
The map's fingerprint: sha256:d38e337129523949…
Add the badge to the code's README
If you are an author or a maintainer of this paper's code, you can add this badge. It says what OSCR knows of the paper (its code, its validated tracing map) and links the code to this page. Paste one of these snippets under the README's title. Keep the two marks around it, so that the badge can be replaced in place and is never added twice. OSCR changes nothing in your repository.
Markdown
<!-- oscr-badge:start -->
[](https://openscicode.org/badge/doi/10.1371/journal.pcbi.1013235)
<!-- oscr-badge:end -->reStructuredText
.. oscr-badge:start
.. image:: https://openscicode.org/badge/doi/10.1371/journal.pcbi.1013235.svg
:target: https://openscicode.org/badge/doi/10.1371/journal.pcbi.1013235
:alt: OSCR
.. oscr-badge:endHTML
<!-- oscr-badge:start -->
<a href="https://openscicode.org/badge/doi/10.1371/journal.pcbi.1013235"><img src="https://openscicode.org/badge/doi/10.1371/journal.pcbi.1013235.svg" alt="OSCR"></a>
<!-- oscr-badge:end -->If you choose to, you can have the badge kept up to date for you, with oscr badge --write from the command line or with the GitHub Action in your repository's workflows. Every other form and option (a card, AsciiDoc, LaTeX, shields.io) is on the badge page.
Request its removal
To ask OSCR to remove this record, the copies of its authors' scripts or its tracing map, use the removal request page: signed in, you say who you are, what to remove and why, then review and confirm the request. Published rules decide every request (how).
Discussion, reproductions, activity
Discussion: code errors and mismatches between the code and the paper about this paper and its code, from readers and its authors, beside the paper and its tracing map.
Report a mismatch between the code and the paper · Report a code error (signed in)
Reproductions: reports from readers who ran the authors' code and did not get the paper's result, what they ran, with which environment, commit and data.
Report a reproduction failure (signed in)
Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.
