mlsanityData to 7 Oct 2026

Certified private data release for sparse Lipschitz functions

arXiv 2302.09680 ↗First posted 19 Feb 2023cs.CRcited by 7

Not on the map. Why?

Abstract (arXiv)

As machine learning has become more relevant for everyday applications, a natural requirement is the protection of the privacy of the training data. When the relevant learning questions are unknown in advance, or hyper-parameter tuning plays a central role, one solution is to release a differentially private synthetic data set that leads to similar conclusions as the original training data. In this work, we introduce an algorithm that enjoys fast rates for the utility loss for sparse Lipschitz queries. Furthermore, we show how to obtain a certificate for the utility loss for a large class of algorithms.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Feb 2023.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

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

7 papers.