Learning distributed representations with complementary components - A generative approximation framework for episodic memory encoding
- 1New York University
Abstract
Episodic memory must preserve detail while storing memories efficiently. We propose a framework of memory encoding in which generative neural network models approximate input through their frozen weights, yielding starting points from which the same weights can reinstate the input. This removes the need for mutually invertible cortical-hippocampal mappings, realizes a tradeoff between computational effort and mnemonic precision, and uses statistical regularities of the stimulus space to find representations that are distributed across the network. We implement this principle with a toy model and with large image-generation AI models, operationalizing mnemonic precision as closer approximation. Our model reproduces key findings from the Mnemonic Similarity Task: shallow encoding selectively impairs lure rejection, as observed in aging populations. Encoding further benefits from expertise: domain-finetuned models need fewer approximation steps for images from their own domain than for images from other domains. Finally, the representational geometry of latent starting points resembles medial temporal lobe but reinstatement through the weights of the network traverses the visual hierarchy in reverse order. Our framework offers a parsimonious and flexible account of memory encoding, where a generative search for a reinstatement-capable starting point finds a path for retrieval directly.
Related
- Cross-region neuron co-firing mediated by ripple oscillations supports distributed working memory representations
- Environmental DNA substrates capture complementary dimensions of insect biodiversity
- Brain and kidney Extracellular Vesicle Morphology and Complementary Brain proteomics after Inflammatory Challenge
- Complementary axes of functional system integrity and integration with divergent clinical correlates characterize focal epilepsy
- Finding dugongs through environmental DNA: a complementary tool for population surveillance
BibTeX
@misc{liu2026learning,
title = {{Learning distributed representations with complementary components - A generative approximation framework for episodic memory encoding}},
author = {H. Liu and M. Mattar and S. Michelmann},
howpublished = {bioRxiv},
year = {2026},
month = oct,
doi = {10.64898/2026.10.18.759853},
url = {https://www.biorxiv.org/content/10.64898/2026.10.18.759853v1},
note = {CC BY-NC-ND},
}
RIS
TY - UNPB
TI - Learning distributed representations with complementary components - A generative approximation framework for episodic memory encoding
AU - H. Liu
AU - M. Mattar
AU - S. Michelmann
PY - 2026
DA - 2026/10/18
PB - bioRxiv
DO - 10.64898/2026.10.18.759853
UR - https://www.biorxiv.org/content/10.64898/2026.10.18.759853v1
AB - Episodic memory must preserve detail while storing memories efficiently. We propose a framework of memory encoding in which generative neural network models approximate input through their frozen weights, yielding starting points from which the same weights can reinstate the input. This removes the need for mutually invertible cortical-hippocampal mappings, realizes a tradeoff between computational effort and mnemonic precision, and uses statistical regularities of the stimulus space to find representations that are distributed across the network. We implement this principle with a toy model and with large image-generation AI models, operationalizing mnemonic precision as closer approximation. Our model reproduces key findings from the Mnemonic Similarity Task: shallow encoding selectively impairs lure rejection, as observed in aging populations. Encoding further benefits from expertise: domain-finetuned models need fewer approximation steps for images from their own domain than for images from other domains. Finally, the representational geometry of latent starting points resembles medial temporal lobe but reinstatement through the weights of the network traverses the visual hierarchy in reverse order. Our framework offers a parsimonious and flexible account of memory encoding, where a generative search for a reinstatement-capable starting point finds a path for retrieval directly.
ER -