Deep Clustering with Associative Memories

Bishwajit Saha, Dmitry Krotov, Mohammed J. Zaki, Parikshit Ram
1/2/2026
cs.CVcs.LG

No confident code implementation found for this paper.

Abstract

Deep clustering - joint representation learning and latent space clustering - is a well studied problem especially in computer vision and text processing under the deep learning framework. While the representation learning is generally differentiable, clustering is an inherently discrete optimization task, requiring various approximations and regularizations to fit in a standard differentiable pipeline. This leads to a somewhat disjointed representation learning and clustering. In this work, we propose a novel loss function utilizing energy-based dynamics via Associative Memories to formulate a new deep clustering method, DCAM, which ties together the representation learning and clustering aspects more intricately in a single objective. Our experiments showcase the advantage of DCAM, producing improved clustering quality for various architecture choices (convolutional, residual or fully-connected) and data modalities (images or text).

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{saha2026deep,
  title  = {Deep Clustering with Associative Memories},
  author = {Bishwajit Saha and Dmitry Krotov and Mohammed J. Zaki and Parikshit Ram},
  year   = {2026},
  eprint = {2601.00963},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.00963v1}
}

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/2601.00963.svg)](https://codeofpaper.com/paper/2601.00963)

Discussion