pith. sign in

arxiv: 1412.7584 · v1 · pith:W3QDDQSGnew · submitted 2014-12-24 · 💻 cs.LG · cs.CR· cs.DB

Differential Privacy and Machine Learning: a Survey and Review

classification 💻 cs.LG cs.CRcs.DB
keywords privacydatalearningmachineprivatealgorithmsinformationdifferential
0
0 comments X
read the original abstract

The objective of machine learning is to extract useful information from data, while privacy is preserved by concealing information. Thus it seems hard to reconcile these competing interests. However, they frequently must be balanced when mining sensitive data. For example, medical research represents an important application where it is necessary both to extract useful information and protect patient privacy. One way to resolve the conflict is to extract general characteristics of whole populations without disclosing the private information of individuals. In this paper, we consider differential privacy, one of the most popular and powerful definitions of privacy. We explore the interplay between machine learning and differential privacy, namely privacy-preserving machine learning algorithms and learning-based data release mechanisms. We also describe some theoretical results that address what can be learned differentially privately and upper bounds of loss functions for differentially private algorithms. Finally, we present some open questions, including how to incorporate public data, how to deal with missing data in private datasets, and whether, as the number of observed samples grows arbitrarily large, differentially private machine learning algorithms can be achieved at no cost to utility as compared to corresponding non-differentially private algorithms.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Near-Exponential Convergence Rates for kNN Classification based on Boltzmann Margin

    stat.ML 2026-06 unverdicted novelty 7.0

    Introduces Boltzmann margin to prove near-exponential convergence rates for kNN classification.

  2. Mind the Gap: Mixtures of Gaussians in Approximate Differential Privacy

    cs.CR 2026-05 unverdicted novelty 7.0

    Mixture mechanisms from Gaussians achieve (ε, δ)-DP with substantially lower l1 and l2 noise than the analytic Gaussian mechanism and approach optimality in low-privacy regimes.

  3. Concrete Problems in AI Safety

    cs.AI 2016-06 accept novelty 7.0

    The paper categorizes five concrete AI safety problems arising from flawed objectives, costly evaluation, and learning dynamics.