Name
Abstract | ||
|---|---|---|
We study an online classification problem with partial feedback in which individuals arrive one at a time from a fixed but unknown distribution, and must be classified as positive or negative. Our algorithm only observes the true label of an individual if they are given a positive classification. This setting captures many classification problems for which fairness is a concern: for example, in criminal recidivism prediction, recidivism is only observed if the inmate is released; in lending applications, loan repayment is only observed if the loan is granted. We require that our algorithms satisfy common statistical fairness constraints (such as equalizing false positive or negative rates - introduced as "equal opportunity" in [18]) at every round, with respect to the underlying distribution. We give upper and lower bounds characterizing the cost of this constraint in terms of the regret rate (and show that it is mild), and give an oracle efficient algorithm that achieves the upper bound. |
Year | Venue | Keywords |
|---|---|---|
2019 | ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019) | equal opportunity |
Field | DocType | Volume |
Loan,Mathematical optimization,Recidivism,Regret,Upper and lower bounds,Oracle,Mathematics | Journal | 32 |
ISSN | Citations | PageRank |
1049-5258 | 0 | 0.34 |
References | Authors | |
17 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yahav Bechavod | 1 | 0 | 1.35 |
| Katrina Ligett | 2 | 923 | 66.19 |
| Aaron Roth | 3 | 1937 | 110.48 |
| Bo Waggoner | 4 | 57 | 11.80 |
| Zhiwei Steven Wu | 5 | 157 | 30.92 |