%0 Journal Article %1 dwork2020abstracting %A Dwork, Cynthia %A Ilvento, Christina %A Rothblum, Guy N. %A Sur, Pragya %D 2020 %K fairness interpretability %T Abstracting Fairness: Oracles, Metrics, and Interpretability %U http://arxiv.org/abs/2004.01840 %X It is well understood that classification algorithms, for example, for deciding on loan applications, cannot be evaluated for fairness without taking context into account. We examine what can be learned from a fairness oracle equipped with an underlying understanding of ``true'' fairness. The oracle takes as input a (context, classifier) pair satisfying an arbitrary fairness definition, and accepts or rejects the pair according to whether the classifier satisfies the underlying fairness truth. Our principal conceptual result is an extraction procedure that learns the underlying truth; moreover, the procedure can learn an approximation to this truth given access to a weak form of the oracle. Since every ``truly fair'' classifier induces a coarse metric, in which those receiving the same decision are at distance zero from one another and those receiving different decisions are at distance one, this extraction process provides the basis for ensuring a rough form of metric fairness, also known as individual fairness. Our principal technical result is a higher fidelity extractor under a mild technical constraint on the weak oracle's conception of fairness. Our framework permits the scenario in which many classifiers, with differing outcomes, may all be considered fair. Our results have implications for interpretablity -- a highly desired but poorly defined property of classification systems that endeavors to permit a human arbiter to reject classifiers deemed to be ``unfair'' or illegitimately derived.

@article{dwork2020abstracting, abstract = {It is well understood that classification algorithms, for example, for deciding on loan applications, cannot be evaluated for fairness without taking context into account. We examine what can be learned from a fairness oracle equipped with an underlying understanding of ``true'' fairness. The oracle takes as input a (context, classifier) pair satisfying an arbitrary fairness definition, and accepts or rejects the pair according to whether the classifier satisfies the underlying fairness truth. Our principal conceptual result is an extraction procedure that learns the underlying truth; moreover, the procedure can learn an approximation to this truth given access to a weak form of the oracle. Since every ``truly fair'' classifier induces a coarse metric, in which those receiving the same decision are at distance zero from one another and those receiving different decisions are at distance one, this extraction process provides the basis for ensuring a rough form of metric fairness, also known as individual fairness. Our principal technical result is a higher fidelity extractor under a mild technical constraint on the weak oracle's conception of fairness. Our framework permits the scenario in which many classifiers, with differing outcomes, may all be considered fair. Our results have implications for interpretablity -- a highly desired but poorly defined property of classification systems that endeavors to permit a human arbiter to reject classifiers deemed to be ``unfair'' or illegitimately derived.}, added-at = {2020-04-07T12:34:28.000+0200}, author = {Dwork, Cynthia and Ilvento, Christina and Rothblum, Guy N. and Sur, Pragya}, biburl = {https://www.bibsonomy.org/bibtex/2c234f7337a3a32ba6b5218d35d9564c9/kirk86}, description = {[2004.01840] Abstracting Fairness: Oracles, Metrics, and Interpretability}, interhash = {344ba9a98f38e20a670cfb03d0c59645}, intrahash = {c234f7337a3a32ba6b5218d35d9564c9}, keywords = {fairness interpretability}, note = {cite arxiv:2004.01840Comment: 17 pages, 1 figure}, timestamp = {2020-04-07T12:34:28.000+0200}, title = {Abstracting Fairness: Oracles, Metrics, and Interpretability}, url = {http://arxiv.org/abs/2004.01840}, year = 2020 }