Dense associative memory on the Bures-Wasserstein space

Chandan Tankala, Krishnakumar Balasubramanian
9/27/2025
cs.LGcs.AImath.ST

No official code found. Best implementation: chandantankala/DDAM (0 stars, last commit 2025-09-28).

Abstract

Dense associative memories (DAMs) store and retrieve patterns via energy-functional fixed points, but existing models are limited to vector representations. We extend DAMs to probability distributions equipped with the 2-Wasserstein distance, focusing mainly on the Bures-Wasserstein class of Gaussian densities. Our framework defines a log-sum-exp energy over stored distributions and a retrieval dynamics aggregating optimal transport maps in a Gibbs-weighted manner. Stationary points correspond to self-consistent Wasserstein barycenters, generalizing classical DAM fixed points. We prove exponential storage capacity, provide quantitative retrieval guarantees under Wasserstein perturbations, and validate the model on synthetic and real-world distributional tasks. This work elevates associative memory from vectors to full distributions, bridging classical DAMs with modern generative modeling and enabling distributional storage and retrieval in memory-augmented learning.

View on arXivView PDF

Code Implementations(1)

Dense Associative Memory on the Bures-Wasserstein Space

00PythonSep 27, 20251 years ago

Similar Papers

Cite this paper

@article{tankala2025dense,
  title  = {Dense associative memory on the Bures-Wasserstein space},
  author = {Chandan Tankala and Krishnakumar Balasubramanian},
  year   = {2025},
  eprint = {2509.23162},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.23162v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2509.23162.svg)](https://codeofpaper.com/paper/2509.23162)

Discussion