Probabilistic Margins for Instance Reweighting in Adversarial Training
Qizhou Wang, Feng Liu, Bo Han, Tongliang Liu, Chen Gong, Gang Niu,, Mingyuan Zhou, Masashi Sugiyama

TL;DR
This paper introduces probabilistic margins as continuous, path-independent measures for reweighting adversarial data, leading to improved robustness in adversarial training.
Contribution
It proposes three novel probabilistic margins for data reweighting that are more reliable and effective than existing methods.
Findings
PM-based reweighting outperforms state-of-the-art methods
PMs are reliable and correlate with data safety
Experiments validate the effectiveness of the proposed approach
Abstract
Reweighting adversarial data during training has been recently shown to improve adversarial robustness, where data closer to the current decision boundaries are regarded as more critical and given larger weights. However, existing methods measuring the closeness are not very reliable: they are discrete and can take only a few values, and they are path-dependent, i.e., they may change given the same start and end points with different attack paths. In this paper, we propose three types of probabilistic margin (PM), which are continuous and path-independent, for measuring the aforementioned closeness and reweighting adversarial data. Specifically, a PM is defined as the difference between two estimated class-posterior probabilities, e.g., such the probability of the true label minus the probability of the most confusing label given some natural data. Though different PMs capture different…
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
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Anomaly Detection Techniques and Applications · Integrated Circuits and Semiconductor Failure Analysis
