Learning Fair Robustness via Domain Mixup
Meiyu Zhong, Ravi Tandon

TL;DR
This paper introduces a mixup-based adversarial training method to achieve fairer robustness across classes, supported by theoretical analysis and experiments on synthetic and real datasets.
Contribution
It proposes a novel mixup approach combined with adversarial training to reduce class-wise robustness disparities, with theoretical guarantees and empirical validation.
Findings
Reduces class-wise adversarial risk disparity
Improves class-wise natural risk balance
Demonstrates effectiveness on CIFAR-10 dataset
Abstract
Adversarial training is one of the predominant techniques for training classifiers that are robust to adversarial attacks. Recent work, however has found that adversarial training, which makes the overall classifier robust, it does not necessarily provide equal amount of robustness for all classes. In this paper, we propose the use of mixup for the problem of learning fair robust classifiers, which can provide similar robustness across all classes. Specifically, the idea is to mix inputs from the same classes and perform adversarial training on mixed up inputs. We present a theoretical analysis of this idea for the case of linear classifiers and show that mixup combined with adversarial training can provably reduce the class-wise robustness disparity. This method not only contributes to reducing the disparity in class-wise adversarial risk, but also the class-wise natural risk.…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Ethics and Social Impacts of AI
MethodsMixup
