SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2002.09343 · NeurIPS · 2020

Robust Optimization for Fairness with Noisy Protected Groups

U Berkeley, Michael Jordan, Serena Wang, Wenshuo Guo, Harikrishna Narasimhan, Andrew Cotter, Maya Gupta

arXiv · PDF · Open in the Atlas

Code that ran

1 of 3 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 2 no recorded run), measured 2026-11-21; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2002.09343.json · badge: /api/ran/2002.09343.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
wenshuoguo/robust-fairness-code canonical (classifier label)
classifier basis: classifier_2025
1 ran · 2 no recorded run
FunctionStatusWhere it lives
load_dataset_boston Ran
ran; our contract draft was wrong, not the code
wenshuoguo/robust-fairness-code/data.py
code served (permissive licence) · get_code("c81884ce46232622")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned DataFrame. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import os
import pandas as pd
import tempfile
import shutil

# Create a temporary directory and a mock boston_processed.csv file
temp_dir = tempfile.mkdtemp()
data_subdir = os.path.join(temp_dir, 'data')
os.makedirs(data_subdir, exist_ok=True)

# Create a minimal mock dataset with the expected columns
mock_data = {
    'SEX': ['M', 'F', 'M'],
    'FIO_YEAR': [2010, 2011, 2010],
    'PRIORS': ['Yes', 'No', 'Yes'],
    'COMPLEXION': ['Light', 'Dark', 'Medium'],
    'FIOFS_REASONS': ['Reason1', 'Reason2', 'Reason1'],
    'DESCRIPTION': ['Desc1', 'Desc2', 'Desc1'],
    'DIST': ['Dist1', 'Dist2', 'Dist1'],
    'OFFICER_ID': ['Off1', 'Off2', 'Off1'],
    'PROXY_RACE': ['Race1', 'Race2', 'Race1'],
    'target': [0, 1, 0]
}

mock_df = pd.DataFrame(mock_data)
csv_path = os.path.join(data_subdir, 'boston_processed.csv')
mock_df.to_csv(csv_path, index=False)

# Monkey-patch os.path.dirname to return our temp directory
original_dirname = os.path.dirname
def mock_dirname(path):
    if 'load_dataset_boston' in path or path == '':
        return temp_dir
    return original_dirname(path)

os.path.dirname = mock_dirname

ARGS = {
    'binarize': True
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1
Imports
pandas — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type DataFrame — a DataFrame output has no array shape of its own; none is stated — the instrument coerces any output to an array; for a DataFrame output the recorded ndim 2 and dtype family float describe that coercion, not the output, and are not stated
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
preprocess_data_boston Not yet run
unverified (harvested, no recorded run)
wenshuoguo/robust-fairness-code/data.py
code served (permissive licence) · get_code("913b7ac4a164b157")
How it ran

no invocation recorded.

preprocess_data_nypd Not yet run
unverified (harvested, no recorded run)
wenshuoguo/robust-fairness-code/data.py
code served (permissive licence) · get_code("09e2e3c68ebb10cc")
How it ran

no invocation recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 3 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-21.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Many existing fairness criteria for machine learning involve equalizing some metric across protected groups such as race or gender. However, practitioners trying to audit or enforce such group-based criteria can easily face the problem of noisy or biased protected group information. First, we study the consequences of naïvely relying on noisy protected group labels: we provide an upper bound on the fairness violations on the true groups G when the fairness criteria are satisfied on noisy groups Ĝ. Second, we introduce two new approaches using robust optimization that, unlike the naïve approach of only relying on Ĝ, are guaranteed to satisfy fairness criteria on the true protected groups G while minimizing a training objective. We provide theoretical guarantees that one such approach converges to an optimal feasible solution. Using two case studies, we show empirically that the robust approaches achieve better true group fairness guarantees than the naïve approach.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2002.09343")
get_code_for_paper("2002.09343")
have("2002.09343")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2002.09343.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2002.09343.svg)](https://syntology.ai/paper/2002.09343)

Connect an agent — have() is free.