REVIEW 3 cited by
Conditional Learning of Fair Representations
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We propose a novel algorithm for learning fair representations that can simultaneously mitigate two notions of disparity among different demographic subgroups in the classification setting. Two key components underpinning the design of our algorithm are balanced error rate and conditional alignment of representations. We show how these two components contribute to ensuring accuracy parity and equalized false-positive and false-negative rates across groups without impacting demographic parity. Furthermore, we also demonstrate both in theory and on two real-world experiments that the proposed algorithm leads to a better utility-fairness trade-off on balanced datasets compared with existing algorithms on learning fair representations for classification.
Forward citations
Cited by 3 Pith papers
-
Learning Representational Disparities
A new fair-ML method learns interpretable differences between observed and desired human decisions to reduce downstream outcome disparity, with a proof of full mitigation under simplifying assumptions.
-
FairDD: Enhancing Fairness with domain-incremental learning in dermatological disease diagnosis
FairDD uses domain-incremental replay, mixup, contrastive learning, and distillation to improve the accuracy-fairness tradeoff of dermatological classifiers on Fitzpatrick-17k and ISIC 2019.
-
Fair Distillation: Teaching Fairness from Biased Teachers in Medical Imaging
FairDi trains biased per-group teachers and distills them into one student, reporting better accuracy-fairness trade-offs than prior methods on medical imaging benchmarks.
Discussion (0). Continue with ORCID to comment.