Pith. sign in

REVIEW 1 cited by

Controllable Guarantees for Fair Outcomes via Contrastive Information Estimation

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 2101.04108 v3 pith:OR7OQOE4 submitted 2021-01-11 cs.LG stat.ML

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

Controlling bias in training datasets is vital for ensuring equal treatment, or parity, between different groups in downstream applications. A naive solution is to transform the data so that it is statistically independent of group membership, but this may throw away too much information when a reasonable compromise between fairness and accuracy is desired. Another common approach is to limit the ability of a particular adversary who seeks to maximize parity. Unfortunately, representations produced by adversarial approaches may still retain biases as their efficacy is tied to the complexity of the adversary used during training. To this end, we theoretically establish that by limiting the mutual information between representations and protected attributes, we can assuredly control the parity of any downstream classifier. We demonstrate an effective method for controlling parity through mutual information based on contrastive information estimators and show that they outperform approaches that rely on variational bounds based on complex generative models. We test our approach on UCI Adult and Heritage Health datasets and demonstrate that our approach provides more informative representations across a range of desired parity thresholds while providing strong theoretical guarantees on the parity of any downstream algorithm.

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