Description:

Wednesday, May 13 at 12 p.m. CDT
Delivered via Zoom
Registration is required 

Public debates about classification by algorithms has created tension around what it means to be fair to different groups. Cornell University’s Jon Kleinberg will consider key fairness conditions at the heart of these debates, and discuss recent work on the interactions between these conditions. He will also explore how the complexity of a classification rule interacts with its fairness properties, showing how natural ways of approximating a classifier via a simpler rule can act in conflict with fairness goals. 

Jon Kleinberg
Professor, Cornell University

Jon Kleinberg is the Tisch University Professor in the Departments of Computer Science and Information Science at Cornell University. His research focuses on the interaction of algorithms and networks, and the roles they play in large-scale social and information systems. He is a member of the National Academy of Sciences and the National Academy of Engineering. In addition, he is the recipient of MacArthur, Packard, Simons, Sloan, and Vannevar Bush research fellowships, as well awards including the Harvey Prize, Nevanlinna Prize, and ACM Prize in Computing.