Pure Differential Privacy for Functional Summaries via a Laplace-like
Process
- URL: http://arxiv.org/abs/2309.00125v2
- Date: Sun, 3 Mar 2024 23:49:48 GMT
- Title: Pure Differential Privacy for Functional Summaries via a Laplace-like
Process
- Authors: Haotian Lin, Matthew Reimherr
- Abstract summary: This work introduces a novel mechanism for differential privacy on functional summaries.
The Independent Component Laplace Process (ICLP) mechanism treats the summaries of interest as truly infinite-dimensional objects.
Numerical experiments on synthetic and real datasets demonstrate the efficacy of the proposed mechanism.
- Score: 8.557392136621894
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Many existing mechanisms to achieve differential privacy (DP) on
infinite-dimensional functional summaries often involve embedding these
summaries into finite-dimensional subspaces and applying traditional DP
techniques. Such mechanisms generally treat each dimension uniformly and
struggle with complex, structured summaries. This work introduces a novel
mechanism for DP functional summary release: the Independent Component Laplace
Process (ICLP) mechanism. This mechanism treats the summaries of interest as
truly infinite-dimensional objects, thereby addressing several limitations of
existing mechanisms. We establish the feasibility of the proposed mechanism in
multiple function spaces. Several statistical estimation problems are
considered, and we demonstrate one can enhance the utility of sanitized
summaries by oversmoothing their non-private counterpart. Numerical experiments
on synthetic and real datasets demonstrate the efficacy of the proposed
mechanism.
Related papers
- Composable Part-Based Manipulation [61.48634521323737]
We propose composable part-based manipulation (CPM) to improve learning and generalization of robotic manipulation skills.
CPM comprises a collection of composable diffusion models, where each model captures a different inter-object correspondence.
We validate our approach in both simulated and real-world scenarios, demonstrating its effectiveness in achieving robust and generalized manipulation capabilities.
arXiv Detail & Related papers (2024-05-09T16:04:14Z) - Unified Mechanism-Specific Amplification by Subsampling and Group Privacy Amplification [54.1447806347273]
Amplification by subsampling is one of the main primitives in machine learning with differential privacy.
We propose the first general framework for deriving mechanism-specific guarantees.
We analyze how subsampling affects the privacy of groups of multiple users.
arXiv Detail & Related papers (2024-03-07T19:36:05Z) - Bounded and Unbiased Composite Differential Privacy [25.427802467876248]
The objective of differential privacy (DP) is to protect privacy by producing an output distribution that is indistinguishable between two neighboring databases.
Existing solutions attempt to address this issue by employing post-processing or truncation techniques.
We propose a novel differentially private mechanism which uses a composite probability density function to generate bounded and unbiased outputs.
arXiv Detail & Related papers (2023-11-04T04:43:47Z) - Truncated Laplace and Gaussian mechanisms of RDP [28.227024132603123]
The Laplace mechanism and the Gaussian mechanism are primary mechanisms in differential privacy.
Due to the infinite-range random variables they generate, the Laplace and Gaussian mechanisms may return values that are semantically impossible, such as negative numbers.
arXiv Detail & Related papers (2023-09-22T06:37:45Z) - Cactus Mechanisms: Optimal Differential Privacy Mechanisms in the
Large-Composition Regime [12.420941209631742]
We study the design of optimal differential privacy mechanisms in the limit of a large number of compositions.
In this regime the best privacy mechanism is the one that minimizes the Kullback-Leibler divergence.
We show that our quantization approach can be arbitrarily close to an optimal mechanism.
arXiv Detail & Related papers (2022-06-25T20:05:50Z) - Pessimism meets VCG: Learning Dynamic Mechanism Design via Offline
Reinforcement Learning [114.36124979578896]
We design a dynamic mechanism using offline reinforcement learning algorithms.
Our algorithm is based on the pessimism principle and only requires a mild assumption on the coverage of the offline data set.
arXiv Detail & Related papers (2022-05-05T05:44:26Z) - Discovering Latent Causal Variables via Mechanism Sparsity: A New
Principle for Nonlinear ICA [81.4991350761909]
Independent component analysis (ICA) refers to an ensemble of methods which formalize this goal and provide estimation procedure for practical application.
We show that the latent variables can be recovered up to a permutation if one regularizes the latent mechanisms to be sparse.
arXiv Detail & Related papers (2021-07-21T14:22:14Z) - Transformers with Competitive Ensembles of Independent Mechanisms [97.93090139318294]
We propose a new Transformer layer which divides the hidden representation and parameters into multiple mechanisms, which only exchange information through attention.
We study TIM on a large-scale BERT model, on the Image Transformer, and on speech enhancement and find evidence for semantically meaningful specialization as well as improved performance.
arXiv Detail & Related papers (2021-02-27T21:48:46Z) - Near Instance-Optimality in Differential Privacy [38.8726789833284]
We develop notions of instance optimality in differential privacy inspired by classical statistical theory.
We also develop inverse sensitivity mechanisms, which are instance optimal (or nearly instance optimal) for a large class of estimands.
arXiv Detail & Related papers (2020-05-16T04:53:48Z) - Exact representations of many body interactions with RBM neural networks [77.34726150561087]
We exploit the representation power of RBMs to provide an exact decomposition of many-body contact interactions into one-body operators.
This construction generalizes the well known Hirsch's transform used for the Hubbard model to more complicated theories such as Pionless EFT in nuclear physics.
arXiv Detail & Related papers (2020-05-07T15:59:29Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.