Inherent Trade-Offs in Algorithmic Fairness
Recent discussion in the public sphere about classification by algorithms has involved tension between competing notions of what it means for such a classification to be fair to different groups. We consider several of the key fairness conditions that lie at the heart of these debates, and discuss recent research establishing inherent trade-offs between these conditions. We also consider a variety of methods for promoting fairness and related notions for classification and selection problems that involve sets rather than just individuals.
Jon Kleinberg is the Tisch University Professor in the Department of Computer Science and the Department of Information Science at Cornell University. His research focuses on issues at the interface of networks and information, with an emphasis on the social and information networks that underpin the web and other online media. His work has been supported by an NSF Career Award, an ONR Young Investigator Award, a MacArthur Foundation Fellowship, a Packard Foundation Fellowship, a Simons Investigator Award, a Sloan Foundation Fellowship, and grants from Facebook, Google, Yahoo!, the ARO, and the NSF. He is a member of the National Academy of Sciences, the National Academy of Engineering, and the American Academy of Arts and Sciences.
If you require video captions for accessibility and this video does not have captions, click here to request video captioning.
Related Paper
This talk is based on joint work with Sendhil Mullainathan, Manish Raghavan, and Maithra Raghu. The paper can be downloaded at https://arxiv.org/abs/1609.05807v2.
