Log In Sign Up

Permute-and-Flip: A new mechanism for differentially private selection

by   Ryan McKenna, et al.

We consider the problem of differentially private selection. Given a finite set of candidate items and a quality score for each item, our goal is to design a differentially private mechanism that returns an item with a score that is as high as possible. The most commonly used mechanism for this task is the exponential mechanism. In this work, we propose a new mechanism for this task based on a careful analysis of the privacy constraints. The expected score of our mechanism is always at least as large as the exponential mechanism, and can offer improvements up to a factor of two. Our mechanism is simple to implement and runs in linear time.


page 1

page 2

page 3

page 4


Exponential Randomized Response: Boosting Utility in Differentially Private Selection

A differentially private selection algorithm outputs from a finite set t...

Private Selection from Private Candidates

Differentially Private algorithms often need to select the best amongst ...

Majority Vote for Distributed Differentially Private Sign Selection

Privacy-preserving data analysis has become prevailing in recent years. ...

Two Differentially Private Rating Collection Mechanisms for Recommender Systems

We design two mechanisms for the recommender system to collect user rati...

Concentration of the exponential mechanism and differentially private multivariate medians

We prove concentration inequalities for the output of the exponential me...

Free Gap Estimates from the Exponential Mechanism, Sparse Vector, Noisy Max and Related Algorithms

Private selection algorithms, such as the Exponential Mechanism, Noisy M...

Optimal Approximation – Smoothness Tradeoffs for Soft-Max Functions

A soft-max function has two main efficiency measures: (1) approximation ...