Differentiable Clustering with Perturbed Spanning Forests

Abstract

We introduce a differentiable clustering method based on stochastic perturbations of minimum-weight spanning forests. This allows us to include clustering in end-to-end trainable pipelines, with efficient gradients. We show that our method performs well even in difficult settings, such as data sets with high noise and challenging geometries. We also formulate an ad hoc loss to efficiently learn from partial clustering data using this operation. We demonstrate its performance on several data sets for supervised and semi-supervised tasks.

Cite

Text

Stewart et al. "Differentiable Clustering with Perturbed Spanning Forests." Neural Information Processing Systems, 2023.

Markdown

[Stewart et al. "Differentiable Clustering with Perturbed Spanning Forests." Neural Information Processing Systems, 2023.](https://mlanthology.org/neurips/2023/stewart2023neurips-differentiable/)

BibTeX

@inproceedings{stewart2023neurips-differentiable,
  title     = {{Differentiable Clustering with Perturbed Spanning Forests}},
  author    = {Stewart, Lawrence and Bach, Francis R. and Llinares-Lopez, Felipe and Berthet, Quentin},
  booktitle = {Neural Information Processing Systems},
  year      = {2023},
  url       = {https://mlanthology.org/neurips/2023/stewart2023neurips-differentiable/}
}