Private Algorithms Can Always Be Extended

10/30/2018
by   Christian Borgs, et al.
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

research
10/30/2018

Private Algorithms Can be Always Extended

We consider the following fundamental question on ϵ-differential privacy...
research
09/12/2023

Deciding Differential Privacy of Online Algorithms with Multiple Variables

We consider the problem of checking the differential privacy of online r...
research
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...
research
07/19/2023

The importance of feature preprocessing for differentially private linear optimization

Training machine learning models with differential privacy (DP) has rece...
research
07/16/2020

Private Approximations of a Convex Hull in Low Dimensions

We give the first differentially private algorithms that estimate a vari...
research
12/31/2020

Kamino: Constraint-Aware Differentially Private Data Synthesis

Organizations are increasingly relying on data to support decisions. Whe...
research
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...

Please sign up or login with your details

Forgot password? Click here to reset