[2603.20656] Sinkhorn Based Associative Memory Retrieval Using Spherical Hellinger Kantorovich Dynamics
About this article
Abstract page for arXiv paper 2603.20656: Sinkhorn Based Associative Memory Retrieval Using Spherical Hellinger Kantorovich Dynamics
Statistics > Machine Learning arXiv:2603.20656 (stat) [Submitted on 21 Mar 2026] Title:Sinkhorn Based Associative Memory Retrieval Using Spherical Hellinger Kantorovich Dynamics Authors:Aratrika Mustafi, Soumya Mukherjee View a PDF of the paper titled Sinkhorn Based Associative Memory Retrieval Using Spherical Hellinger Kantorovich Dynamics, by Aratrika Mustafi and 1 other authors View PDF HTML (experimental) Abstract:We propose a dense associative memory for empirical measures (weighted point clouds). Stored patterns and queries are finitely supported probability measures, and retrieval is defined by minimizing a Hopfield-style log-sum-exp energy built from the debiased Sinkhorn divergence. We derive retrieval dynamics as a spherical Hellinger Kantorovich (SHK) gradient flow, which updates both support locations and weights. Discretizing the flow yields a deterministic algorithm that uses Sinkhorn potentials to compute barycentric transport steps and a multiplicative simplex reweighting. Under local separation and PL-type conditions we prove basin invariance, geometric convergence to a local minimizer, and a bound showing the minimizer remains close to the corresponding stored pattern. Under a random pattern model, we further show that these Sinkhorn basins are disjoint with high probability, implying exponential capacity in the ambient dimension. Experiments on synthetic Gaussian point-cloud memories demonstrate robust recovery from perturbed queries versus a Euclidean H...