Pith. sign in

REVIEW 1 cited by

Transfer of Machine Learning Fairness across Domains

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

arxiv 1906.09688 v3 pith:CGTS3D75 submitted 2019-06-24 cs.LG stat.ML

classification cs.LGstat.ML
keywords domainfairnessuseddomainstargetacrossdatadebias
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

If our models are used in new or unexpected cases, do we know if they will make fair predictions? Previously, researchers developed ways to debias a model for a single problem domain. However, this is often not how models are trained and used in practice. For example, labels and demographics (sensitive attributes) are often hard to observe, resulting in auxiliary or synthetic data to be used for training, and proxies of the sensitive attribute to be used for evaluation of fairness. A model trained for one setting may be picked up and used in many others, particularly as is common with pre-training and cloud APIs. Despite the pervasiveness of these complexities, remarkably little work in the fairness literature has theoretically examined these issues. We frame all of these settings as domain adaptation problems: how can we use what we have learned in a source domain to debias in a new target domain, without directly debiasing on the target domain as if it is a completely new problem? We offer new theoretical guarantees of improving fairness across domains, and offer a modeling approach to transfer to data-sparse target domains. We give empirical results validating the theory and showing that these modeling approaches can improve fairness metrics with less data.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Fairness Overfitting in Machine Learning: An Information-Theoretic Perspective

    cs.LG 2025-06 reject novelty 5.0 of 10

    Claims computable MI/CMI bounds on fairness generalization error, but the core derivation uses an invalid variance-based Hoeffding step.

Pith tools