Sample Selection for Fair and Robust TrainingDownload PDF

21 May 2021, 20:45 (modified: 26 Oct 2021, 08:17)NeurIPS 2021 PosterReaders: Everyone
Keywords: trustworthy AI, fairness, robustness, sample selection
TL;DR: We propose a sample selection-based algorithm for fair and robust training that performs unbiased selection of samples in the presence of data corruption and is easy to use.
Abstract: Fairness and robustness are critical elements of Trustworthy AI that need to be addressed together. Fairness is about learning an unbiased model while robustness is about learning from corrupted data, and it is known that addressing only one of them may have an adverse affect on the other. In this work, we propose a sample selection-based algorithm for fair and robust training. To this end, we formulate a combinatorial optimization problem for the unbiased selection of samples in the presence of data corruption. Observing that solving this optimization problem is strongly NP-hard, we propose a greedy algorithm that is efficient and effective in practice. Experiments show that our method obtains fairness and robustness that are better than or comparable to the state-of-the-art technique, both on synthetic and benchmark real datasets. Moreover, unlike other fair and robust training baselines, our algorithm can be used by only modifying the sampling step in batch selection without changing the training algorithm or leveraging additional clean data.
Supplementary Material: zip
Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.
Code: https://github.com/yuji-roh/fair-robust-selection
9 Replies

Loading