mlsanityData to 14 Oct 2026

Classification with Partially Private Features

arXiv 2312.07583 ↗First posted 11 Dec 2023cs.LG cs.CRcited by 4

Not on the map. Why?

Abstract (arXiv)

In this paper, we consider differentially private classification when some features are sensitive, while the rest of the features and the label are not. We adapt the definition of differential privacy naturally to this setting. Our main contribution is a novel adaptation of AdaBoost that is not only provably differentially private, but also significantly outperforms a natural benchmark that assumes the entire data of the individual is sensitive in the experiments. As a surprising observation, we show that boosting randomly generated classifiers suffices to achieve high accuracy. Our approach easily adapts to the classical setting where all the features are sensitive, providing an alternate algorithm for differentially private linear classification with a much simpler privacy proof and comparable or higher accuracy than differentially private logistic regression on real-world datasets.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 11 of its 26 references that are in the map. First posted on arXiv 11 Dec 2023.

Builds on

11 of 26 references.

References · 11

  1. 2016Deep Learning with Differential Privacycited by 2,728
  2. 2016Semi-supervised Knowledge Transfer for Deep Learning from Private Training Datacited by 348
  3. 2013The Composition Theorem for Differential Privacycited by 297
  4. 2018Scalable Private Learning with PATEcited by 269
  5. 2021Deep Learning with Label Differential Privacycited by 117
  6. 2019Diffprivlib: The IBM Differential Privacy Librarycited by 53
  7. 2015Explaining the Success of AdaBoost and Random Forests as Interpolating Classifierscited by 45
  8. 2021Accuracy, Interpretability, and Differential Privacy via Explainable Boostingcited by 24
  9. 2019Privacy-Preserving Gradient Boosting Decision Treescited by 20
  10. 2021Label differential privacy via clusteringcited by 20
  11. 2016Differentially Private Random Decision Forests using Smooth Sensitivitycited by 16

Built on by

Cited by year

Citing papers per year: 2024: 4.

4 papers.