Private Synthetic Data with Hierarchical Structure
Not on the map. Why?
Abstract (arXiv)
We study the problem of differentially private synthetic data generation for hierarchical datasets in which individual data points are grouped together (e.g., people within households). In particular, to measure the similarity between the synthetic dataset and the underlying private one, we frame our objective under the problem of private query release, generating a synthetic dataset that preserves answers for some collection of queries (i.e., statistics like mean aggregate counts). However, while the application of private synthetic data to the problem of query release has been well studied, such research is restricted to non-hierarchical data domains, raising the initial question -- what queries are important when considering data of this form? Moreover, it has not yet been established how one can generate synthetic data at both the group and individual-level while capturing such statistics. In light of these challenges, we first formalize the problem of hierarchical query release, in which the goal is to release a collection of statistics for some hierarchical dataset. Specifically, we provide a general set of statistical queries that captures relationships between attributes at both the group and individual-level. Subsequently, we introduce private synthetic data algorithms for hierarchical query release and evaluate them on hierarchical datasets derived from the American Community Survey and Allegheny Family Screening Tool data. Finally, we look to the American Community Survey, whose inherent hierarchical structure gives rise to another set of domain-specific queries that we run experiments with.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 17 of its 35 references that are in the map. First posted on arXiv 13 Jun 2022.
Builds on
17 of 35 references.
References · 17
- 2019Modeling Tabular data using Conditional GANcited by 695
- 2016Concentrated Differential Privacy: Simplifications, Extensions, and Lower Boundscited by 339
- 2018Differentially Private Generative Adversarial Networkcited by 235
- 2016Concentrated Differential Privacycited by 139
- 2022AIM: An Adaptive and Iterative Mechanism for Differentially Private Synthetic Datacited by 88
- 2019Graphical-model based estimation and inference for differential privacycited by 73
- 2021Iterative Methods for Private Synthetic Data: Unifying Framework and New Methodscited by 58
- 2021Differentially Private Query Release Through Adaptive Projectioncited by 50
- 2020New Oracle-Efficient Algorithms for Private Synthetic Data Releasecited by 43
- 2021Leveraging Public Data for Practical Private Query Releasecited by 39
- 2020Differentially Private Synthetic Data: Applied Evaluations and Enhancementscited by 36
- 2019The Power of Factorization Mechanisms in Local and Central Differential Privacycited by 30
5 more
- 2018Optimizing error of high-dimensional statistical queries under differential privacycited by 29
- 2014Dual Query: Practical Private Query Release for High Dimensional Datacited by 26
- 2020Private Post-GAN Boostingcited by 20
- 2014Private Multiplicative Weights Beyond Linear Queriescited by 17
- 2020Bounding, Concentrating, and Truncating: Unifying Privacy Loss Composition for Data Analyticscited by 2
Built on by
Citing papers per year: 2023: 2.
2 papers.
- 2023Summary Statistic Privacy in Data Sharingcited by 6
- 2023ResidualPlanner+: a scalable matrix mechanism for marginals and beyondcited by 2
- 2023ResidualPlanner+: a scalable matrix mechanism for marginals and beyond14 May 2023
- 2023Summary Statistic Privacy in Data Sharing3 Mar 2023