Papers › Achieving Equalized Odds by Resampling Sensitive Attributes

Achieving Equalized Odds by Resampling Sensitive Attributes

8 Jun 2020NeurIPS 2020 12arXiv:2006.04292archive 2025-07-28

Yaniv Romano, Stephen Bates, Emmanuel J. Candès

We present a flexible framework for learning predictive models that approximately satisfy the equalized odds notion of fairness. This is achieved by introducing a general discrepancy functional that rigorously quantifies violations of this criterion. This differentiable functional is used as a penalty driving the model parameters towards equalized odds. To rigorously evaluate fitted models, we develop a formal hypothesis test to detect whether a prediction rule violates this property, the first such test in the literature. Both the model fitting and hypothesis testing leverage a resampled version of the sensitive attribute obeying equalized odds, by construction. We demonstrate the applicability and validity of the proposed framework both in regression and multi-class classification problems, reporting improved performance over state-of-the-art methods. Lastly, we show how to incorporate techniques for equitable uncertainty quantification---unbiased for each group under study---to communicate the results of the data analysis in exact terms.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2006.04292")

Code

Syntology Ran 0 of 15 code samples harvested from 1 repository linked to this paper; 15 have no recorded run.

By repository: official repository: 15 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

yromano/fair_dummies officialmentioned in paperpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

15 samples harvested; 0 ran; 0 honoured the contract we drafted; 15 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

15unverified

Licence: 0 of the 15 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from yromano/fair_dummies. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

calc_accuracy yromano/fair_dummies/fair_dummies/utility_functions.py official repository unverified MIT (permissive) · 155d81bdb4a2fc74 · report
compute_acc yromano/fair_dummies/fair_dummies/utility_functions.py official repository unverified MIT (permissive) · 38ec48431e45abd1 · report
covariance_diff_biased yromano/fair_dummies/fair_dummies/fair_dummies_learning.py official repository unverified MIT (permissive) · 593e5ed0481b0f0a · report
density_estimation yromano/fair_dummies/fair_dummies/utility_functions.py official repository unverified MIT (permissive) · 4df32aef40d16f61 · report
gen_synthetic_data yromano/fair_dummies/get_dataset.py official repository unverified MIT (permissive) · 61c33a916c6ce639 · report
get_coverage yromano/fair_dummies/fair_dummies/cf_classification.py official repository unverified MIT (permissive) · 4fd60a8ea590875e · report
get_length yromano/fair_dummies/fair_dummies/cf_classification.py official repository unverified MIT (permissive) · 2ffe424106b5b1c8 · report
get_stat yromano/fair_dummies/fair_dummies/cf_classification.py official repository unverified MIT (permissive) · 50b70e5728cd9316 · report
pretrain_adversary yromano/fair_dummies/fair_dummies/fair_dummies_learning.py official repository unverified MIT (permissive) · 29bbbca9a634482a · report
pretrain_adversary yromano/fair_dummies/others/adv_debiasing.py official repository unverified MIT (permissive) · f80ebdfe287d35b2 · report
pretrain_adversary_fast_loader yromano/fair_dummies/fair_dummies/fair_dummies_learning.py official repository unverified MIT (permissive) · dd0d940686cc5d71 · report
read_crimes_data yromano/fair_dummies/get_dataset.py official repository unverified MIT (permissive) · e31d738cefaa827e · report
read_meps_data yromano/fair_dummies/get_dataset.py official repository unverified MIT (permissive) · 3db0f0aa6ae485cb · report
train yromano/fair_dummies/others/adv_debiasing.py official repository unverified MIT (permissive) · f6d9e0317d4ec628 · report
train_regressor yromano/fair_dummies/others/adv_debiasing.py official repository unverified MIT (permissive) · 46780301e5c26af6 · report

Tasks

AttributeFairnessMulti-class ClassificationTwo-sample testingUncertainty Quantification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections