The reviewed record of science sign in
Pith

arxiv: 2211.04449 · v1 · pith:MNLSKUAV · submitted 2022-11-04 · cs.CR · cs.LG

Fairness-aware Regression Robust to Adversarial Attacks

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:MNLSKUAVrecord.jsonopen to challenge →

classification cs.CR cs.LG
keywords robustfairadversarialregressionadversariallyattacksdatadataset
0
0 comments X
read the original abstract

In this paper, we take a first step towards answering the question of how to design fair machine learning algorithms that are robust to adversarial attacks. Using a minimax framework, we aim to design an adversarially robust fair regression model that achieves optimal performance in the presence of an attacker who is able to add a carefully designed adversarial data point to the dataset or perform a rank-one attack on the dataset. By solving the proposed nonsmooth nonconvex-nonconcave minimax problem, the optimal adversary as well as the robust fairness-aware regression model are obtained. For both synthetic data and real-world datasets, numerical results illustrate that the proposed adversarially robust fair models have better performance on poisoned datasets than other fair machine learning models in both prediction accuracy and group-based fairness measure.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.