TY - GEN
T1 - From the Real Towards the Ideal
T2 - 4th Symposium on Foundations of Responsible Computing, FORC 2023
AU - Dwork, Cynthia
AU - Reingold, Omer
AU - Rothblum, Guy N.
N1 - Publisher Copyright: © Cynthia Dwork, Omer Reingold, and Guy N. Rothblum; licensed under Creative Commons License CC-BY 4.0.
PY - 2023/6/1
Y1 - 2023/6/1
N2 - Prediction algorithms assign scores in [0,1] to individuals, often interpreted as “probabilities” of a positive outcome, for example, of repaying a loan or succeeding in a job. Success, however, rarely depends only on the individual: it is a function of the individual's interaction with the environment, past and present. Environments do not treat all demographic groups equally. We initiate the study of corrective transformations τ that map predictors of success in the real world to predictors in a better world. In the language of algorithmic fairness, letting p∗ denote the true probabilities of success in the real, unfair, world, we characterize the transformations τ for which it is feasible to find a predictor q̃ that is indistinguishable from τ(p∗). The problem is challenging because we do not have access to probabilities or even outcomes in a better world. Nor do we have access to probabilities p∗ in the real world. The only data available for training are outcomes from the real world. We obtain a complete characterization of when it is possible to learn predictors that are indistinguishable from τ(p∗), in the form of a simple-to-state criterion describing necessary and sufficient conditions for doing so. This criterion is inextricably bound with the very existence of uncertainty.
AB - Prediction algorithms assign scores in [0,1] to individuals, often interpreted as “probabilities” of a positive outcome, for example, of repaying a loan or succeeding in a job. Success, however, rarely depends only on the individual: it is a function of the individual's interaction with the environment, past and present. Environments do not treat all demographic groups equally. We initiate the study of corrective transformations τ that map predictors of success in the real world to predictors in a better world. In the language of algorithmic fairness, letting p∗ denote the true probabilities of success in the real, unfair, world, we characterize the transformations τ for which it is feasible to find a predictor q̃ that is indistinguishable from τ(p∗). The problem is challenging because we do not have access to probabilities or even outcomes in a better world. Nor do we have access to probabilities p∗ in the real world. The only data available for training are outcomes from the real world. We obtain a complete characterization of when it is possible to learn predictors that are indistinguishable from τ(p∗), in the form of a simple-to-state criterion describing necessary and sufficient conditions for doing so. This criterion is inextricably bound with the very existence of uncertainty.
UR - https://www.scopus.com/pages/publications/85163582709
U2 - 10.4230/LIPIcs.FORC.2023.1
DO - 10.4230/LIPIcs.FORC.2023.1
M3 - منشور من مؤتمر
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 4th Symposium on Foundations of Responsible Computing, FORC 2023
A2 - Talwar, Kunal
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Y2 - 7 June 2023 through 9 June 2023
ER -