Attack Transferability Characterization for Adversarially Robust Multi-label Classification
Not on the map. Why?
Abstract (arXiv)
Despite of the pervasive existence of multi-label evasion attack, it is an open yet essential problem to characterize the origin of the adversarial vulnerability of a multi-label learning system and assess its attackability. In this study, we focus on non-targeted evasion attack against multi-label classifiers. The goal of the threat is to cause miss-classification with respect to as many labels as possible, with the same input perturbation. Our work gains in-depth understanding about the multi-label adversarial attack by first characterizing the transferability of the attack based on the functional properties of the multi-label classifier. We unveil how the transferability level of the attack determines the attackability of the classifier via establishing an information-theoretic analysis of the adversarial risk. Furthermore, we propose a transferability-centered attackability assessment, named Soft Attackability Estimator (SAE), to evaluate the intrinsic vulnerability level of the targeted multi-label classifier. This estimator is then integrated as a transferability-tuning regularization term into the multi-label learning paradigm to achieve adversarially robust classification. The experimental study on real-world data echos the theoretical analysis and verify the validity of the transferability-regularized multi-label learning method.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 16 of its 30 references that are in the map. First posted on arXiv 29 Jun 2021.
Builds on
16 of 30 references.
References · 16
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
- 2017Formal Guarantees on the Robustness of a Classifier against Adversarial Manipulationcited by 185
- 2020Reasoning About Generalization via Conditional Mutual Informationcited by 147
- 2018Rademacher Complexity for Adversarially Robust Generalizationcited by 132
- 2018Large Margin Deep Networks for Classificationcited by 112
- 2016Robustness of classifiers: from adversarial to random noisecited by 88
- 2015Analysis of classifiers' robustness to adversarial perturbationscited by 76
- 2016Restricted Strong Convexity Implies Weak Submodularitycited by 52
- 2017Analyzing the Robustness of Nearest Neighbors to Adversarial Examplescited by 36
- 2018Theoretical Analysis of Adversarial Learning: A Minimax Approachcited by 31
- 2020Boundary thickness and robustness in learning modelscited by 26
4 more
- 2018The Adversarial Attack and Detection under the Fisher Information Metriccited by 18
- 2019Multi-Label Adversarial Perturbationscited by 18
- 2018Adversarial Risk Bounds via Function Transformationcited by 12
- 2020Characterizing the Evasion Attackability of Multi-label Classifierscited by 5
Built on by
Citing papers per year: 2022: 2.
2 papers.
- 2022Superclass Adversarial Attackcited by 1
- 2022Towards Effective Multi-Label Recognition Attacks via Knowledge Graph Consistencycited by 0
- 2022Towards Effective Multi-Label Recognition Attacks via Knowledge Graph Consistency11 Jul 2022
- 2022Superclass Adversarial Attack29 May 2022