Privacy with Estimation Guarantees
Not on the map. Why?
Abstract (arXiv)
We study the central problem in data privacy: how to share data with an analyst while providing both privacy and utility guarantees to the user that owns the data. In this setting, we present an estimation-theoretic analysis of the privacy-utility trade-off (PUT). Here, an analyst is allowed to reconstruct (in a mean-squared error sense) certain functions of the data (utility), while other private functions should not be reconstructed with distortion below a certain threshold (privacy). We demonstrate how chi-square information captures the fundamental PUT in this case and provide bounds for the best PUT. We propose a convex program to compute privacy-assuring mappings when the functions to be disclosed and hidden are known a priori and the data distribution is known. We derive lower bounds on the minimum mean-squared error of estimating a target function from the disclosed data and evaluate the robustness of our approach when an empirical distribution is used to compute the privacy-assuring mappings instead of the true data distribution. We illustrate the proposed approach through two numerical experiments.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Oct 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 0; 2025: 1.
4 papers.
- 2025Fundamental Limits of Perfect Concept Erasure25 Mar 2025
- 2023Summary Statistic Privacy in Data Sharing3 Mar 2023
- 2022Ultra-marginal Feature Importance: Learning from Data with Causal Guarantees21 Apr 2022
- 2021Quantum algorithms for SVD-based data representation and analysis19 Apr 2021