BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Colloquium: Fairness in Algorithmic Decision Making
DTSTART:20211101T161500
DTEND:20211101T171500
DTSTAMP:20260407T002928Z
UID:7a2975e9fb3ccee20f569b08eff1a72ec88d10e95379851bf49c78f7
CATEGORIES:Conferences - Seminars
DESCRIPTION:By: Sampath Kannan - University of Pennsylvania\nVideo of his 
 talk\n\nAbstract\nIn this talk we take a theoretical computer science pers
 pective on fairness of decisions made by algorithms\, typically machine le
 arning algorithms. We describe various ways of quantitatively formulating 
 fairness\, and systematic ways in which algorithms can fail to be fair. We
  survey models and techniques for achieving fairness in some scenarios and
  the challenges to doing so in others.\n\nBio\nSampath Kannan is the Henry
  Salvatori Professor in the Department of Computer and Information Science
  at the University of Pennsylvania. He obtained his Ph.D. from the Univers
 ity of California\, Berkeley in 1989.\n\nHis research interests are in the
  areas of Algorithmic Fairness\, Program Reliability\, Streaming Computati
 on\, and Computational Biology. Sampath Kannan served as Associate Dean fo
 r Academics in the School of Engineering and Applied Science at Penn betwe
 en 2006 and 2008 and as Division Director for the Computing and Communicat
 ion Foundations Division at the National Science Foundation from 2008 to 2
 010. He was the Chair of the Computer and Information Science Department a
 t Penn from 2014 to 2018. He is a Fellow of the ACM and the AAAS\, and a r
 ecepient of the SIGACT Distinguished Service Award.\n\nMore information
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR