Timezone: »

 
Invited Talk: The Roles of Simplicity and Interpretability in Fairness Guarantees
Jon Kleinberg

We explore two arguments at the interface between the interpretability of algorithms and their fairness properties. We first discuss how a well-regulated algorithm for screening decisions, because it makes notions like feature sets and objective functions explicit, can be audited for evidence of discrimination in ways that would be essentially impossible for human decision-making. We then consider connections to a related fundamental point -- that as we simplify algorithms, reducing the range of features available to them, there is a precise sense in which we can find ourselves sacrificing accuracy and equity simultaneously. This talk will be based on joint work with Jens Ludwig, Sendhil Mullainathan, Manish Raghavan, and Cass Sunstein.

Author Information

Jon Kleinberg (Cornell University)

More from the Same Authors