mlsanityData to 7 Oct 2026

Approximate, Adapt, Anonymize (3A): a Framework for Privacy Preserving Training Data Release for Machine Learning

arXiv 2307.01875 ↗First posted 4 Jul 2023cs.LG cs.CRcited by 5

Not on the map. Why?

Abstract (arXiv)

The availability of large amounts of informative data is crucial for successful machine learning. However, in domains with sensitive information, the release of high-utility data which protects the privacy of individuals has proven challenging. Despite progress in differential privacy and generative modeling for privacy-preserving data release in the literature, only a few approaches optimize for machine learning utility: most approaches only take into account statistical metrics on the data itself and fail to explicitly preserve the loss metrics of machine learning models that are to be subsequently trained on the generated data. In this paper, we introduce a data release framework, 3A (Approximate, Adapt, Anonymize), to maximize data utility for machine learning, while preserving differential privacy. We also describe a specific implementation of this framework that leverages mixture models to approximate, kernel-inducing points to adapt, and Gaussian differential privacy to anonymize a dataset, in order to ensure that the resulting data is both privacy-preserving and high utility. We present experimental evidence showing minimal discrepancy between performance metrics of models trained on real versus privatized datasets, when evaluated on held-out real data. We also compare our results with several privacy-preserving synthetic data generation models (such as differentially private generative adversarial networks), and report significant increases in classification performance metrics compared to state-of-the-art models. These favorable comparisons show that the presented framework is a promising direction of research, increasing the utility of low-risk synthetic data release for machine learning.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 12 of its 36 references that are in the map. First posted on arXiv 4 Jul 2023.

Builds on

12 of 36 references.

References · 12

  1. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  2. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  3. 2016Semi-supervised Knowledge Transfer for Deep Learning from Private Training Datacited by 347
  4. 2018Scalable Private Learning with PATEcited by 266
  5. 2018Differentially Private Generative Adversarial Networkcited by 235
  6. 2020Dataset Meta-Learning from Kernel Ridge-Regressioncited by 230
  7. 2018Improving the Gaussian Mechanism for Differential Privacy: Analytical Calibration and Optimal Denoisingcited by 216
  8. 2021Dataset Distillation with Infinitely Wide Convolutional Networkscited by 215
  9. 2019Deep Learning with Gaussian Differential Privacycited by 112
  10. 2018Data Augmentation by Pairing Samples for Images Classificationcited by 96
  11. 2017Straggler Mitigation in Distributed Optimization Through Data Encodingcited by 26
  12. 2019Towards Formalizing the GDPR's Notion of Singling Outcited by 25

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 3; 2025: 1.

5 papers.