.png){kind=icon}
Return
Boosting Fair Classifier Generalization through Adaptive Priority Reweighing
.png){kind=icon}
OA
AI
DOI：10.1145/3665895.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With the increasing penetration of machine learning applications in critical decision-making areas, calls for algorithmic fairness are more prominent. Although there have been various modalities to improve algorithmic fairness through learning with fairness constraints, their performance does not generalize well in the test set. A performance-promising fair algorithm with better generalizability is needed. This article proposes a novel adaptive reweighing method to eliminate the impact of the distribution shifts between training and test data on model generalizability. Most previous reweighing methods propose to assign a unified weight for each (sub)group. Rather, our method granularly models the distance from the sample predictions to the decision boundary. Our adaptive reweighing method prioritizes samples closer to the decision boundary and assigns a higher weight to improve the generalizability of fair classifiers. Extensive experiments are performed to validate the generalizability of our adaptive priority reweighing method for accuracy and fairness measures (i.e., equal opportunity, equalized odds, and demographic parity) in tabular benchmarks. We also highlight the performance of our method in improving the fairness of language and vision models. The code is available at https://github.com/che2198/APW.
Keywords:
Algorithmic fairness
reweighing method
trustworthy AI
Journal
IF:
4.8
Papers:
1.3K
Citations:
4.4K
Organization
Cited Papers
ShareSave
NMR spectra of aromatic amines and amides-I Correlations of amino proton shifts with Hammett substituents constants with Hückel electron densities.png)
Tetrahedron
TetrahedronIF0
PREAI
ShareSaveShareSave
View more