T$_k$ML-AP: Adversarial Attacks to Top-$k$ Multi-Label Learning
This addresses a security problem for users of top-k multi-label learning in applications such as image annotation, but it is incremental as it builds on existing adversarial attack research.
The paper tackles the vulnerability of top-k multi-label learning algorithms to adversarial attacks by developing methods to create perturbations that reduce performance on image annotation systems, achieving effective results on benchmark datasets like PASCAL VOC and MS COCO.
Top-$k$ multi-label learning, which returns the top-$k$ predicted labels from an input, has many practical applications such as image annotation, document analysis, and web search engine. However, the vulnerabilities of such algorithms with regards to dedicated adversarial perturbation attacks have not been extensively studied previously. In this work, we develop methods to create adversarial perturbations that can be used to attack top-$k$ multi-label learning-based image annotation systems (TkML-AP). Our methods explicitly consider the top-$k$ ranking relation and are based on novel loss functions. Experimental evaluations on large-scale benchmark datasets including PASCAL VOC and MS COCO demonstrate the effectiveness of our methods in reducing the performance of state-of-the-art top-$k$ multi-label learning methods, under both untargeted and targeted attacks.