Information Extraction Under Privacy Constraints
Shahab Asoodeh, Mario Diaz, Fady Alajaji, and Tam\'as Linder

TL;DR
This paper investigates how to maximize information extraction from a variable Y about Y itself while preserving privacy of another correlated variable X, analyzing properties, closed-form solutions, and asymptotic behavior under different privacy measures.
Contribution
It introduces the rate-privacy function, analyzes its properties, provides closed-form expressions for certain distributions, and studies its asymptotic behavior in continuous cases.
Findings
Rate-privacy function quantifies maximum extractable information under privacy constraints.
Closed-form expression derived for a large family of joint distributions.
Asymptotic analysis reveals differences between discrete and continuous cases.
Abstract
A privacy-constrained information extraction problem is considered where for a pair of correlated discrete random variables governed by a given joint distribution, an agent observes and wants to convey to a potentially public user as much information about as possible without compromising the amount of information revealed about . 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 under a privacy constraint between 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
