DeepAI
Log In Sign Up

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

10/23/2020
by   Ryan McKenna, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

01/11/2022

Exponential Randomized Response: Boosting Utility in Differentially Private Selection

A differentially private selection algorithm outputs from a finite set t...
11/19/2018

Private Selection from Private Candidates

Differentially Private algorithms often need to select the best amongst ...
09/08/2022

Majority Vote for Distributed Differentially Private Sign Selection

Privacy-preserving data analysis has become prevailing in recent years. ...
04/28/2016

Two Differentially Private Rating Collection Mechanisms for Recommender Systems

We design two mechanisms for the recommender system to collect user rati...
10/12/2022

Concentration of the exponential mechanism and differentially private multivariate medians

We prove concentration inequalities for the output of the exponential me...
12/02/2020

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

Private selection algorithms, such as the Exponential Mechanism, Noisy M...
10/22/2020

Optimal Approximation – Smoothness Tradeoffs for Soft-Max Functions

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