Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Algorithms, Complexity, and Bias
Speaker:Nisheeth Vishnoi
coming from:EPF Lausanne
Speakers Bio:Nisheeth Vishnoi is a faculty member of the School of Computer and

Communication Sciences at École Polytechnique Fédérale de Lausanne. He
is also an associate of the International Center for Theoretical
Sciences, Bangalore, an adjunct faculty member of IIT Delhi and IIT
Kanpur, and a co-founder of the Computation, Nature, and Society
ThinkTank. His research focuses on foundational problems in
algorithms, optimization, statistics, and complexity, and how tools
from these areas can be used to address emerging algorithmic questions
in society, nature, and machine learning. Topics from these areas that
he is currently interested in include algorithmic fairness,
understanding emergent behavior in biological systems, and developing
algorithms that can go beyond the worst-case in machine learning. He
is the recipient of the Best Paper Award at FOCS 2005, the IBM
Research Pat Goldberg Memorial Award for 2006, the Indian National
Science Academy Young Scientist Award for 2011 and the IIT Bombay
Young Alumni Achievers Award for 2016.

Event Type:MPI Colloquium Series Distinguished Speaker
Visibility:D1, D2, D3, D4, D5, SWS, RG1, MMCI
We use this to send out email in the morning.
Level:Public Audience
Language:English
Date, Time and Location
Date:Thursday, 7 December 2017
Time:14:15
Duration:75 Minutes
Location:Saarbrücken
Building:E1 4
Room:024
Abstract
Bias is an increasingly observed phenomenon in the world of machine
learning (ML) and artificial intelligence (AI): From gender bias in
image search, racial bias in court bail pleas, to biases in
worldviews depicted in personalized newsfeeds. At the core, what is
powering today’s AI/ML are algorithms for fundamental computational
problems such as classification, data summarization, ranking, and
online learning. Such algorithms have traditionally been designed with
the goal of maximizing some notion of “utility” and identifying or
controlling bias in their output has not been a consideration. As a
consequence, they have the ability to pass (or even worsen) the bias
from the input to the output.

In this talk, I will explain the emergence of bias in algorithmic
decision making and address some of the challenges towards developing
a systematic algorithmic framework to control biases and the
corresponding complexity barriers in the aforementioned problems. As a
concrete example, I will focus on the problem of data summarization
and show how the pursuit of “unbiased'' algorithms for this problem
has led to connections between entropy, continuous optimization,
polynomials, and the complexity of the Kadison-Singer problem.
Contact
Name(s):Petra Schaaf
Phone:5000
EMail:--email address not disclosed on the web
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Note:
Attachments, File(s):

Created by:Petra Schaaf/AG5/MPII/DE, 11/29/2017 12:22 PMLast modified by:Uwe Brahm/MPII/DE, 12/07/2017 07:01 AM
  • Petra Schaaf, 11/29/2017 12:27 PM -- Created document.