Exactly Minimax-Optimal Locally Differentially Private Sampling
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914997726085120 |
|---|---|
| author | Park, Hyun-Young Asoodeh, Shahab Lee, Si-Hyeon |
| author_facet | Park, Hyun-Young Asoodeh, Shahab Lee, Si-Hyeon |
| contents | The sampling problem under local differential privacy has recently been studied with potential applications to generative models, but a fundamental analysis of its privacy-utility trade-off (PUT) remains incomplete. In this work, we define the fundamental PUT of private sampling in the minimax sense, using the f-divergence between original and sampling distributions as the utility measure. We characterize the exact PUT for both finite and continuous data spaces under some mild conditions on the data distributions, and propose sampling mechanisms that are universally optimal for all f-divergences. Our numerical experiments demonstrate the superiority of our mechanisms over baselines, in terms of theoretical utilities for finite data space and of empirical utilities for continuous data space. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_22699 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Exactly Minimax-Optimal Locally Differentially Private Sampling Park, Hyun-Young Asoodeh, Shahab Lee, Si-Hyeon Machine Learning Cryptography and Security The sampling problem under local differential privacy has recently been studied with potential applications to generative models, but a fundamental analysis of its privacy-utility trade-off (PUT) remains incomplete. In this work, we define the fundamental PUT of private sampling in the minimax sense, using the f-divergence between original and sampling distributions as the utility measure. We characterize the exact PUT for both finite and continuous data spaces under some mild conditions on the data distributions, and propose sampling mechanisms that are universally optimal for all f-divergences. Our numerical experiments demonstrate the superiority of our mechanisms over baselines, in terms of theoretical utilities for finite data space and of empirical utilities for continuous data space. |
| title | Exactly Minimax-Optimal Locally Differentially Private Sampling |
| topic | Machine Learning Cryptography and Security |
| url | https://arxiv.org/abs/2410.22699 |