Differentially Private Database Release via Kernel Mean Embeddings
Not on the map. Why?
Abstract (arXiv)
We lay theoretical foundations for new database release mechanisms that allow third-parties to construct consistent estimators of population statistics, while ensuring that the privacy of each individual contributing to the database is protected. The proposed framework rests on two main ideas. First, releasing (an estimate of) the kernel mean embedding of the data generating random variable instead of the database itself still allows third-parties to construct consistent estimators of a wide class of population statistics. Second, the algorithm can satisfy the definition of differential privacy by basing the released kernel mean embedding on entirely synthetic data points, while controlling accuracy through the metric available in a Reproducing Kernel Hilbert Space. We describe two instantiations of the proposed framework, suitable under different scenarios, and prove theoretical results guaranteeing differential privacy of the resulting algorithms and the consistency of estimators constructed from their outputs.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Oct 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 4; 2023: 3; 2024: 1; 2025: 1.
12 papers.
- 2021ADePT: Auto-encoder based Differentially Private Text Transformationcited by 31
- 2021Hermite Polynomial Features for Private Data Generationcited by 21
- 2022Nystr"om Kernel Mean Embeddingscited by 21
- 2021Controlling Wasserstein Distances by Kernel Norms with Application to Compressive Statistical Learningcited by 13
- 2023Efficient Numerical Integration in Reproducing Kernel Hilbert Spaces via Leverage Scores Samplingcited by 10
- 2025From Easy to Hard: Building a Shortcut for Differentially Private Image Synthesiscited by 6
- 2023Differentially Private Low-dimensional Synthetic Data from High-dimensional Datasetscited by 4
- 2022Coefficient-based Regularized Distribution Regressioncited by 2
- 2024Differentially Private Synthetic Data with Private Density Estimationcited by 2
- 2023Differentially Private Synthetic Data Using KD-Treescited by 1
- 2022RFFNet: Large-Scale Interpretable Kernel Methods via Random Fourier Featurescited by 0
- 2022M2M: A general method to perform various data analysis tasks from a differentially private sketchcited by 0
- 2025From Easy to Hard: Building a Shortcut for Differentially Private Image Synthesis2 Apr 2025
- 2024Differentially Private Synthetic Data with Private Density Estimation6 May 2024
- 2023Efficient Numerical Integration in Reproducing Kernel Hilbert Spaces via Leverage Scores Sampling22 Nov 2023
- 2023Differentially Private Synthetic Data Using KD-Trees19 Jun 2023
- 2023Differentially Private Low-dimensional Synthetic Data from High-dimensional Datasets26 May 2023
- 2022M2M: A general method to perform various data analysis tasks from a differentially private sketch25 Nov 2022
- 2022RFFNet: Large-Scale Interpretable Kernel Methods via Random Fourier Features11 Nov 2022
- 2022Coefficient-based Regularized Distribution Regression26 Aug 2022
- 2022Nystr"om Kernel Mean Embeddings31 Jan 2022
- 2021Controlling Wasserstein Distances by Kernel Norms with Application to Compressive Statistical Learning1 Dec 2021
- 2021Hermite Polynomial Features for Private Data Generation9 Jun 2021
- 2021ADePT: Auto-encoder based Differentially Private Text Transformation29 Jan 2021