REVIEW 2 cited by
Relational Data Synthesis using Generative Adversarial Networks: A Design Space Exploration
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The proliferation of big data has brought an urgent demand for privacy-preserving data publishing. Traditional solutions to this demand have limitations on effectively balancing the tradeoff between privacy and utility of the released data. Thus, the database community and machine learning community have recently studied a new problem of relational data synthesis using generative adversarial networks (GAN) and proposed various algorithms. However, these algorithms are not compared under the same framework and thus it is hard for practitioners to understand GAN's benefits and limitations. To bridge the gaps, we conduct so far the most comprehensive experimental study that investigates applying GAN to relational data synthesis. We introduce a unified GAN-based framework and define a space of design solutions for each component in the framework, including neural network architectures and training strategies. We conduct extensive experiments to explore the design space and compare with traditional data synthesis approaches. Through extensive experiments, we find that GAN is very promising for relational data synthesis, and provide guidance for selecting appropriate design solutions. We also point out limitations of GAN and identify future research directions.
Forward citations
Cited by 2 Pith papers
-
RIPOST: Two-Phase Private Decomposition for Multidimensional Data
A two-phase, depth-free differential privacy decomposition method that separates empty from non-empty regions first and then refines by aggregation error, yielding lower range-query error than prior methods.
-
A Systematic Evaluation of Generative Models on Tabular Transportation Data
Two new evaluation metrics, a network-graph similarity score and a holdout-based privacy ratio, reveal that current tabular generative models fall short on NYC taxi trip data.
Discussion (0). Continue with ORCID to comment.