Campuses:

unconstrained

Wednesday, June 19, 2019 - 4:15pm - 5:05pm
Moritz Hardt (University of California, Berkeley)
We clarify what fairness guarantees we can and cannot expect to follow from unconstrained machine learning. Specifically, we characterize when unconstrained learning on its own implies group calibration, that is, the outcome variable is conditionally independent of group membership given the score. We show that under reasonable conditions, the deviation from satisfying group calibration is upper bounded by the excess risk of the learned score relative to the Bayes optimal score function. A lower bound confirms the optimality of our upper bound.
Subscribe to RSS - unconstrained