mlsanityData to 7 Oct 2026

On the Robustness of Deep Clustering Models: Adversarial Attacks and Defenses

arXiv 2210.01940 ↗First posted 4 Oct 2022cs.LG cs.AI cs.CRcited by 2

Not on the map. Why?

Abstract (arXiv)

Clustering models constitute a class of unsupervised machine learning methods which are used in a number of application pipelines, and play a vital role in modern data science. With recent advancements in deep learning -- deep clustering models have emerged as the current state-of-the-art over traditional clustering approaches, especially for high-dimensional image datasets. While traditional clustering approaches have been analyzed from a robustness perspective, no prior work has investigated adversarial attacks and robustness for deep clustering models in a principled manner. To bridge this gap, we propose a blackbox attack using Generative Adversarial Networks (GANs) where the adversary does not know which deep clustering model is being used, but can query it for outputs. We analyze our attack against multiple state-of-the-art deep clustering models and real-world datasets, and find that it is highly successful. We then employ some natural unsupervised defense approaches, but find that these are unable to mitigate our attack. Finally, we attack Face++, a production-level face clustering API service, and find that we can significantly reduce its performance as well. Through this work, we thus aim to motivate the need for truly robust deep clustering models.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 28 of its 67 references that are in the map. First posted on arXiv 4 Oct 2022.

Builds on

28 of 67 references.

References · 28

  1. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  2. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  3. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  4. 2016Adversarial examples in the physical worldcited by 1,762
  5. 2016InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscited by 858
  6. 2015Unsupervised Deep Embedding for Clustering Analysiscited by 763
  7. 2019Adversarial Training for Free!cited by 638
  8. 2018Black-box Adversarial Attacks with Limited Queries and Informationcited by 499
  9. 2016Transferability in Machine Learning: from Phenomena to Black-Box Attacks using Adversarial Samplescited by 439
  10. 2020SCAN: Learning to Classify Images without Labelscited by 351
  11. 2020Contrastive Clusteringcited by 264
  12. 2021SSD: A Unified Framework for Self-Supervised Outlier Detectioncited by 264
16 more
  1. 2018Generating Adversarial Examples with Adversarial Networkscited by 256
  2. 2016Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clusteringcited by 237
  3. 2018Adversarial Risk and the Dangers of Evaluating Against Weak Attackscited by 221
  4. 2016Deep Unsupervised Clustering with Gaussian Mixture Variational Autoencoderscited by 219
  5. 2016Variational Deep Embedding: An Unsupervised and Generative Approach to Clusteringcited by 219
  6. 2021SPICE: Semantic Pseudo-labeling for Image Clusteringcited by 104
  7. 2015Unsupervised and Semi-supervised Learning with Categorical Generative Adversarial Networkscited by 94
  8. 2017Deep Subspace Clustering Networkscited by 94
  9. 2020Improving Unsupervised Image Clustering With Robust Learningcited by 51
  10. 2021MiCE: Mixture of Contrastive Experts for Unsupervised Image Clusteringcited by 42
  11. 2020Deep Robust Clustering by Contrastive Learningcited by 25
  12. 2019AdvGAN++ : Harnessing latent layers for adversary generationcited by 20
  13. 2018Is Data Clustering in Adversarial Settings Secure?cited by 16
  14. 2020A black-box adversarial attack for poisoning clusteringcited by 16
  15. 2019Suspicion-Free Adversarial Attacks on Clustering Algorithmscited by 11
  16. 2021Nonlinear Projection Based Gradient Estimation for Query Efficient Blackbox Attackscited by 9

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 1.

2 papers.