DeepAI AI Chat
Log In Sign Up

On Differentially Private Online Predictions

by   Haim Kaplan, et al.
Georgetown University
Tel Aviv University

In this work we introduce an interactive variant of joint differential privacy towards handling online processes in which existing privacy definitions seem too restrictive. We study basic properties of this definition and demonstrate that it satisfies (suitable variants) of group privacy, composition, and post processing. We then study the cost of interactive joint privacy in the basic setting of online classification. We show that any (possibly non-private) learning rule can be effectively transformed to a private learning rule with only a polynomial overhead in the mistake bound. This demonstrates a stark difference with more restrictive notions of privacy such as the one studied by Golowich and Livni (2021), where only a double exponential overhead on the mistake bound is known (via an information theoretic upper bound).


page 1

page 2

page 3

page 4


Concurrent Composition Theorems for Differential Privacy

We study the concurrent composition properties of interactive differenti...

Near-Optimal Differentially Private Reinforcement Learning

Motivated by personalized healthcare and other applications involving se...

Private Learning Implies Online Learning: An Efficient Reduction

We study the relationship between the notions of differentially private ...

Local Differential Privacy for Belief Functions

In this paper, we propose two new definitions of local differential priv...

Concurrent Composition for Interactive Differential Privacy with Adaptive Privacy-Loss Parameters

In this paper, we study the concurrent composition of interactive mechan...

That which we call private

A casual reader of the study by Jayaraman and Evans in USENIX Security 2...

SoK: Differential Privacies

Shortly after its introduction in 2006, differential privacy became the ...