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:Differentially Private Approximation Algorithms
Speaker:Katrina Ligett
coming from:Carnegie Mellon
Speakers Bio:http://www.cs.cmu.edu/~katrina
Event Type:Talk
Visibility:D1, D4, RG1, MMCI, D3, D5, SWS
We use this to send out email in the morning.
Level:AG Audience
Language:English
Date, Time and Location
Date:Tuesday, 10 March 2009
Time:14:00
Duration:30 Minutes
Location:Saarbr├╝cken
Building:E1 4
Please note: New Room!
Room:022
Abstract
We consider the problem of designing approximation algorithms for

discrete optimization problems over private data sets, in the
framework of differential privacy (which formalizes the idea of
protecting the privacy of individual input elements). Our results show
that for several commonly studied combinatorial optimization problems,
it is possible to release approximately optimal solutions while
preserving differential privacy; this is true even in cases where it
is impossible under cryptographic definitions of privacy to release
even approximations to the *value* of the optimal solution.

In this talk, we will focus on the private vertex cover problem, where
a set of edges must each be covered by a vertex, without disclosing
the presence or absence of any particular edge. We show an efficient,
differentially-private 2-approximation to the value, and a factor (2 +
16/epsilon)-approximate solution (where epsilon is the differential
privacy parameter, controlling the amount of information disclosure).
We also present a simple lower bound arguing that an Omega(1/epsilon)
factor dependence is natural and necessary.

We will also briefly discuss a variety of other combinatorial
problems, and implications of this work for mechanism design in
submodular maximization problems.

Much of this work was done while the speaker was visiting Microsoft
Research. This work is joint with Anupam Gupta and Aaron Roth (both
at Carnegie Mellon), and Frank McSherry and Kunal Talwar (both at
Microsoft Research).

Contact
Name(s):Evangelia Pyrga
EMail:--email address not disclosed on the web
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Note:
Attachments, File(s):
  • Evangelia Pyrga, 03/09/2009 03:48 PM
  • Uwe Brahm, 03/04/2009 10:02 PM
  • Evangelia Pyrga, 03/04/2009 12:31 PM -- Created document.