DeepAI AI Chat
Log In Sign Up

Private Algorithms Can Always Be Extended

10/30/2018
by   Christian Borgs, et al.
Boston University
MIT
Microsoft
0

We consider the following fundamental question on ϵ-differential privacy. Consider an arbitrary ϵ-differentially private algorithm defined on a subset of the input space. Is it possible to extend it to an ϵ'-differentially private algorithm on the whole input space for some ϵ' comparable with ϵ? In this note we answer affirmatively this question for ϵ'=2ϵ. Our result applies to every input metric space and space of possible outputs. This result originally appeared in a recent paper by the authors [BCSZ18]. We present a self-contained version in this note, in the hopes that it will be broadly useful.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/30/2018

Private Algorithms Can be Always Extended

We consider the following fundamental question on ϵ-differential privacy...
03/30/2020

How to Find a Point in the Convex Hull Privately

We study the question of how to compute a point in the convex hull of an...
05/27/2019

Private Learning Implies Online Learning: An Efficient Reduction

We study the relationship between the notions of differentially private ...
07/16/2020

Private Approximations of a Convex Hull in Low Dimensions

We give the first differentially private algorithms that estimate a vari...
07/21/2022

Differentially Private Partial Set Cover with Applications to Facility Location

It was observed in <cit.> that the Set Cover problem has strong impossib...
10/19/2021

FriendlyCore: Practical Differentially Private Aggregation

Differentially private algorithms for common metric aggregation tasks, s...
05/31/2017

Local Differential Privacy for Physical Sensor Data and Sparse Recovery

In this work we explore the utility of locally differentially private th...