Salvato in:
Dettagli Bibliografici
Autori principali: Awan, Jordan, Cai, Zhanrui
Natura: Preprint
Pubblicazione: 2020
Soggetti:
Accesso online:https://arxiv.org/abs/2006.02397
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866914333206773760
author Awan, Jordan
Cai, Zhanrui
author_facet Awan, Jordan
Cai, Zhanrui
contents A common approach to synthetic data is to sample from a fitted model. We show that under general assumptions, this approach results in a sample with inefficient estimators and whose joint distribution is inconsistent with the true distribution. Motivated by this, we propose a general method of producing synthetic data, which is widely applicable for parametric models, has asymptotically efficient summary statistics, and is both easily implemented and highly computationally efficient. Our approach allows for the construction of both partially synthetic datasets, which preserve certain summary statistics, as well as fully synthetic data which satisfy the strong guarantee of differential privacy (DP), both with the same asymptotic guarantees. We also provide theoretical and empirical evidence that the distribution from our procedure converges to the true distribution. Besides our focus on synthetic data, our procedure can also be used to perform approximate hypothesis tests in the presence of intractable likelihood functions.
format Preprint
id arxiv_https___arxiv_org_abs_2006_02397
institution arXiv
publishDate 2020
record_format arxiv
spellingShingle One Step to Efficient Synthetic Data
Awan, Jordan
Cai, Zhanrui
Statistics Theory
Cryptography and Security
Computation
A common approach to synthetic data is to sample from a fitted model. We show that under general assumptions, this approach results in a sample with inefficient estimators and whose joint distribution is inconsistent with the true distribution. Motivated by this, we propose a general method of producing synthetic data, which is widely applicable for parametric models, has asymptotically efficient summary statistics, and is both easily implemented and highly computationally efficient. Our approach allows for the construction of both partially synthetic datasets, which preserve certain summary statistics, as well as fully synthetic data which satisfy the strong guarantee of differential privacy (DP), both with the same asymptotic guarantees. We also provide theoretical and empirical evidence that the distribution from our procedure converges to the true distribution. Besides our focus on synthetic data, our procedure can also be used to perform approximate hypothesis tests in the presence of intractable likelihood functions.
title One Step to Efficient Synthetic Data
topic Statistics Theory
Cryptography and Security
Computation
url https://arxiv.org/abs/2006.02397