Synthetic data generators – Sequential and private

Olivier Bousquet, Roi Livni, Shay Moran

Research output: Contribution to journalConference articlepeer-review

Abstract

We study the sample complexity of private synthetic data generation over an unbounded sized class of statistical queries, and show that any class that is privately proper PAC learnable admits a private synthetic data generator (perhaps non-efficient). Previous work on synthetic data generators focused on the case that the query class D is finite and obtained sample complexity bounds that scale logarithmically with the size |D|. Here we construct a private synthetic data generator whose sample complexity is independent of the domain size, and we replace finiteness with the assumption that D is privately PAC learnable (a formally weaker task, hence we obtain equivalence between the two tasks).

Original languageEnglish
JournalAdvances in Neural Information Processing Systems
Volume2020-December
StatePublished - 2020
Event34th Conference on Neural Information Processing Systems, NeurIPS 2020 - Virtual, Online
Duration: 6 Dec 202012 Dec 2020

Cite this