paper-with-me

홈 › Papers

Brownian Noise Reduction: Maximizing Privacy Subject to Accuracy Constraints

2022-06-15 · Justin Whitehouse, Zhiwei Steven Wu, Aaditya Ramdas, Ryan Rogers

There is a disconnect between how researchers and practitioners handle privacy-utility tradeoffs. Researchers primarily operate from a privacy first perspective, setting strict privacy requirements and minimizing risk subject to these constraints. Practitioners often desire an accuracy first perspective, possibly satisfied with the greatest privacy they can get subject to obtaining sufficiently small error. Ligett et al. have introduced a "noise reduction" algorithm to address the latter perspective. The authors show that by adding correlated Laplace noise and progressively reducing it on demand, it is possible to produce a sequence of increasingly accurate estimates of a private parameter while only paying a privacy cost for the least noisy iterate released. In this work, we generalize noise reduction to the setting of Gaussian noise, introducing the Brownian mechanism. The Brownian mechanism works by first adding Gaussian noise of high variance corresponding to the final point of a simulated Brownian motion. Then, at the practitioner's discretion, noise is gradually decreased by tracing back along the Brownian path to an earlier time. Our mechanism is more naturally applicable to the common setting of bounded $\ell_2$-sensitivity, empirically outperforms existing work on common statistical tasks, and provides customizable control of privacy loss over the entire interaction with the practitioner. We complement our Brownian mechanism with ReducedAboveThreshold, a generalization of the classical AboveThreshold algorithm that provides adaptive privacy guarantees. Overall, our results demonstrate that one can meet utility constraints while still maintaining strong levels of privacy.

📄 PDF Abstract BibTeX arXiv:2206.07234

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Adaptive Privacy Composition for Accuracy-first Mechanisms

2023-06-24 · NeurIPS 2023 11 · Ryan Rogers, Gennady Samorodnitsky, Zhiwei Steven Wu, Aaditya Ramdas

In many practical applications of differential privacy, practitioners seek to provide the best privacy guarantees subject to a target level of accuracy. A recent line of work by Ligett et al. '17 and Whitehouse et al. '2…

Privacy-Preserving Public Release of Datasets for Support Vector Machine Classification

2019-12-29 · Farhad Farokhi

We consider the problem of publicly releasing a dataset for support vector machine classification while not infringing on the privacy of data subjects (i.e., individuals whose private information is stored in the dataset…

General ClassificationPrivacy Preserving

Accuracy First: Selecting a Differential Privacy Level for Accuracy-Constrained ERM

2017-05-30 · Katrina Ligett, Seth Neel, Aaron Roth, Bo Waggoner 외

Traditional approaches to differential privacy assume a fixed privacy requirement $\epsilon$ for a computation, and attempt to maximize the accuracy of the computation subject to the privacy constraint. As differential p…

Accuracy First: Selecting a Differential Privacy Level for Accuracy Constrained ERM

2017-12-01 · NeurIPS 2017 12 · Katrina Ligett, Seth Neel, Aaron Roth, Bo Waggoner 외

Traditional approaches to differential privacy assume a fixed privacy requirement ε for a computation, and attempt to maximize the accuracy of the computation subject to the privacy constraint. As differential privacy is…

Tight Regret Bounds for Noisy Optimization of a Brownian Motion

2020-01-25 · Zexin Wang, Vincent Y. F. Tan, Jonathan Scarlett

We consider the problem of Bayesian optimization of a one-dimensional Brownian motion in which the $T$ adaptively chosen observations are corrupted by Gaussian noise. We show that as the smallest possible expected cumula…

Bayesian OptimizationTwo-sample testing