mlsanityData to 14 Oct 2026

Classification under local differential privacy

arXiv 1912.04629 ↗First posted 10 Dec 2019math.ST stat.ME stat.MLcited by 9

Not on the map. Why?

Abstract (arXiv)

We consider the binary classification problem in a setup that preserves the privacy of the original sample. We provide a privacy mechanism that is locally differentially private and then construct a classifier based on the private sample that is universally consistent in Euclidean spaces. Under stronger assumptions, we establish the minimax rates of convergence of the excess risk and see that they are slower than in the case when the original sample is available.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). First posted on arXiv 10 Dec 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

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

9 papers.