Optimal Schemes for Discrete Distribution Estimation under Locally Differential Privacy
February 02, 2017 ยท Declared Dead ยท ๐ IEEE Transactions on Information Theory
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Min Ye, Alexander Barg
arXiv ID
1702.00610
Category
cs.LG: Machine Learning
Cross-listed
cs.IT
Citations
193
Venue
IEEE Transactions on Information Theory
Last Checked
4 months ago
Abstract
We consider the minimax estimation problem of a discrete distribution with support size $k$ under privacy constraints. A privatization scheme is applied to each raw sample independently, and we need to estimate the distribution of the raw samples from the privatized samples. A positive number $ฮต$ measures the privacy level of a privatization scheme. For a given $ฮต,$ we consider the problem of constructing optimal privatization schemes with $ฮต$-privacy level, i.e., schemes that minimize the expected estimation loss for the worst-case distribution. Two schemes in the literature provide order optimal performance in the high privacy regime where $ฮต$ is very close to $0,$ and in the low privacy regime where $e^ฮต\approx k,$ respectively. In this paper, we propose a new family of schemes which substantially improve the performance of the existing schemes in the medium privacy regime when $1\ll e^ฮต \ll k.$ More concretely, we prove that when $3.8 < ฮต<\ln(k/9) ,$ our schemes reduce the expected estimation loss by $50\%$ under $\ell_2^2$ metric and by $30\%$ under $\ell_1$ metric over the existing schemes. We also prove a lower bound for the region $e^ฮต \ll k,$ which implies that our schemes are order optimal in this regime.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Machine Learning
๐ฎ
๐ฎ
The Ethereal
๐ฎ
๐ฎ
The Ethereal
Continuous control with deep reinforcement learning
๐
๐
Old Age
Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks
๐
๐
Old Age
Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor
๐
๐
Old Age
SGDR: Stochastic Gradient Descent with Warm Restarts
๐ฎ
๐ฎ
The Ethereal
Asynchronous Methods for Deep Reinforcement Learning
Died the same way โ ๐ป Ghosted
R.I.P.
๐ป
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
๐ป
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
๐ป
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
๐ป
Ghosted