Fast learning, memorization and generalization: A computational characterization of sparse to dense hippocampal-cortical codes

preprint OA: closed CC-BY-4.0
Full text 1,954 characters · extracted from oa-html · click to expand
1 Abstract Classic findings from neuropsychology and animal studies established the hippocampus as a key substrate for rapid learning and episodic memory, with the dentate gyrus exhibiting extreme sparse coding. Sparse coding has long been hypothesized to enable fast learning through pattern separation, enabling rapid separation of highly similar inputs. However, prior computational work has largely focused on episodic memory or simplified linear tasks, leaving open how hippocampal sparsity affects learning speed and generalization in complex tasks. Here, we present a systematic investigation of sparse coding in deep neural networks varying the sparsity level and location (layer depth) and evaluated the functional consequences for learning and generalization. We found that learning performance is maximized at a balanced sparsity level of ∼5%, matching empirical estimates of the hippocampal sparse code. Dimensionality and representational similarity analyses revealed that sparse layers promoted orthogonalization of input representations, mirroring hippocampal pattern separation that enables fast learning. Furthermore, sparsity in early layers led to fast learning only on the training set and poor generalization to a held out test set, reflecting memorization, while sparsity in later layers consistently aided generalization, providing implications for theories of hippocampal-cortical learning. Our findings demonstrate the power and tradeoffs of the hippocampal sparse code, and show how hippocampal-cortical circuits possess the computational capacity to support both fast learning and generalization, depending on where sparsity is implemented. We offer a unifying perspective on how the hippocampus works as a fast, sparse memory system and the hippocampal-cortical pathway as a mechanism for generalizable learning. Competing Interest Statement The authors have declared no competing interest. Footnotes sasananimesh{at}gmail.com

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: oa-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2026) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-23T02:00:01.238055+00:00
License: CC-BY-4.0