End-to-end Differentiable Clustering with Associative Memories

Bishwajit Saha, Dmitry Krotov, Mohammed J. Zaki, Parikshit Ram
6/5/2023
cs.LG

No official code found. Best implementation: bsaha205/clam (7 stars, MIT, last commit 2023-05-16).

Abstract

Clustering is a widely used unsupervised learning technique involving an intensive discrete optimization problem. Associative Memory models or AMs are differentiable neural networks defining a recursive dynamical system, which have been integrated with various deep learning architectures. We uncover a novel connection between the AM dynamics and the inherent discrete assignment necessary in clustering to propose a novel unconstrained continuous relaxation of the discrete clustering problem, enabling end-to-end differentiable clustering with AM, dubbed ClAM. Leveraging the pattern completion ability of AMs, we further develop a novel self-supervised clustering loss. Our evaluations on varied datasets demonstrate that ClAM benefits from the self-supervision, and significantly improves upon both the traditional Lloyd's k-means algorithm, and more recent continuous clustering relaxations (by upto 60% in terms of the Silhouette Coefficient).

View on arXivView PDF

Code Implementations(1)

bsaha205/clamCommunity100%
MIT
70Terra, PythonMay 16, 20233 years agoMIT

Similar Papers

Cite this paper

@article{saha2023endtoend,
  title  = {End-to-end Differentiable Clustering with Associative Memories},
  author = {Bishwajit Saha and Dmitry Krotov and Mohammed J. Zaki and Parikshit Ram},
  year   = {2023},
  eprint = {2306.03209},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.03209v1},
  journal = {ICML 2023 2023}
}

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

Discussion