Information Extraction Under Privacy Constraints
Not on the map. Why?
Abstract (arXiv)
A privacy-constrained information extraction problem is considered where for a pair of correlated discrete random variables (X,Y) governed by a given joint distribution, an agent observes Y and wants to convey to a potentially public user as much information about Y as possible without compromising the amount of information revealed about X. To this end, the so-called em rate-privacy function is introduced to quantify the maximal amount of information (measured in terms of mutual information) that can be extracted from Y under a privacy constraint between X and the extracted information, where privacy is measured using either mutual information or maximal correlation. Properties of the rate-privacy function are analyzed and information-theoretic and estimation-theoretic interpretations of it are presented for both the mutual information and maximal correlation privacy measures. It is also shown that the rate-privacy function admits a closed-form expression for a large family of joint distributions of (X,Y). Finally, the rate-privacy function under the mutual information privacy measure is considered for the case where (X,Y) has a joint probability density function by studying the problem where the extracted information is a uniform quantization of Y corrupted by additive Gaussian noise. The asymptotic behavior of the rate-privacy function is studied as the quantization resolution grows without bound and it is observed that not all of the properties of the rate-privacy function carry over from the discrete to the continuous case.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). First posted on arXiv 7 Nov 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 3; 2023: 1; 2024: 2; 2025: 1; 2026: 2.
9 papers.
- 2022Bottlenecks CLUB: Unifying Information-Theoretic Trade-offs Among Complexity, Leakage, and Utilitycited by 12
- 2024On the Asymptotic Mean Square Error Optimality of Diffusion Modelscited by 10
- 2023Summary Statistic Privacy in Data Sharingcited by 6
- 2022Lossy Compression of Noisy Data for Private and Data-Efficient Learningcited by 1
- 2022Classification Utility, Fairness, and Compactness via Tunable Information Bottleneck and R'enyi Measurescited by 1
- 2024Deep Privacy Funnel Model: From a Discriminative to a Generative Approach with an Application to Face Recognitioncited by 1
- 2025Lower Bounds on the MMSE of Adversarially Inferring Sensitive Featurescited by 0
- 2026Minimax Quantile Lower Bounds for Interactive Statistical Decision Making with Privacycited by 0
- 2026Information Bottleneck under Perfect Privacycited by 0
- 2026Information Bottleneck under Perfect Privacy11 Aug 2026
- 2026Minimax Quantile Lower Bounds for Interactive Statistical Decision Making with Privacy22 Jun 2026
- 2025Lower Bounds on the MMSE of Adversarially Inferring Sensitive Features13 May 2025
- 2024Deep Privacy Funnel Model: From a Discriminative to a Generative Approach with an Application to Face Recognition3 Apr 2024
- 2024On the Asymptotic Mean Square Error Optimality of Diffusion Models5 Mar 2024
- 2023Summary Statistic Privacy in Data Sharing3 Mar 2023
- 2022Bottlenecks CLUB: Unifying Information-Theoretic Trade-offs Among Complexity, Leakage, and Utility11 Jul 2022
- 2022Classification Utility, Fairness, and Compactness via Tunable Information Bottleneck and R'enyi Measures20 Jun 2022
- 2022Lossy Compression of Noisy Data for Private and Data-Efficient Learning7 Feb 2022