TL;DR
This paper introduces a black-box adversarial attack method to evaluate the robustness of clustering algorithms, demonstrating its effectiveness and transferability across different models and scenarios.
Contribution
It proposes a novel, customizable black-box attack framework using a genetic algorithm approach, applicable without internal algorithm knowledge.
Findings
Clustering algorithms are vulnerable to the proposed adversarial samples.
The attack outperforms existing methods in certain scenarios.
Adversarial noise is transferable to supervised models.
Abstract
Clustering algorithms play a fundamental role as tools in decision-making and sensible automation processes. Due to the widespread use of these applications, a robustness analysis of this family of algorithms against adversarial noise has become imperative. To the best of our knowledge, however, only a few works have currently addressed this problem. In an attempt to fill this gap, in this work, we propose a black-box adversarial attack for crafting adversarial samples to test the robustness of clustering algorithms. We formulate the problem as a constrained minimization program, general in its structure and customizable by the attacker according to her capability constraints. We do not assume any information about the internal structure of the victim clustering algorithm, and we allow the attacker to query it as a service only. In the absence of any derivative information, we perform…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
