The reviewed record of science sign in
Pith

arxiv: 2206.05942 · v1 · pith:WSXX5PT7 · submitted 2022-06-13 · cs.LG

Private Synthetic Data with Hierarchical Structure

Reviewed by Pithpith:WSXX5PT7open to challenge →

classification cs.LG
keywords datahierarchicalsyntheticprivatereleaseproblemqueriesquery
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. ResidualPlanner+: a scalable matrix mechanism for marginals and beyond

    cs.DB 2023-05 unverdicted novelty 7.0

    ResidualPlanner provides an optimal scalable matrix mechanism for Gaussian noise on marginal queries that optimizes convex loss functions of variances, with ResidualPlanner+ extending support to combined marginal and ...