pith. sign in

arxiv: 2201.12677 · v2 · pith:XPHJXGGHnew · submitted 2022-01-29 · 💻 cs.DB

AIM: An Adaptive and Iterative Mechanism for Differentially Private Synthetic Data

classification 💻 cs.DB
keywords datasyntheticalgorithmdifferentiallymeasurementsprivatequeriesvariety
0
0 comments X
read the original abstract

We propose AIM, a new algorithm for differentially private synthetic data generation. AIM is a workload-adaptive algorithm within the paradigm of algorithms that first selects a set of queries, then privately measures those queries, and finally generates synthetic data from the noisy measurements. It uses a set of innovative features to iteratively select the most useful measurements, reflecting both their relevance to the workload and their value in approximating the input data. We also provide analytic expressions to bound per-query error with high probability which can be used to construct confidence intervals and inform users about the accuracy of generated data. We show empirically that AIM consistently outperforms a wide variety of existing mechanisms across a variety of experimental settings.

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 7 Pith papers

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

  1. SoK: Reconstruction Attacks on Synthetic Tabular Data (Insights from Winning the NIST CRC)

    cs.CR 2026-06 unverdicted novelty 8.0

    The first systematization of reconstruction attacks on synthetic tabular data finds that generator choice dominates privacy risk over attack choice, with differential privacy effective only at low budgets and most lea...

  2. DPDSyn: Improving Differentially Private Dataset Synthesis for Model Training by Downstream Task Guidance

    cs.CR 2026-04 unverdicted novelty 7.0

    DPDSyn guides differentially private dataset synthesis with a downstream-task model trained under DP, yielding higher accuracy and faster generation than prior distribution-selection methods.

  3. 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 ...

  4. Differentially Private Synthetic Data via APIs 4: Tabular Data

    cs.LG 2026-06 unverdicted novelty 6.0

    Tab-PE extends Private Evolution to tabular data with heuristic operators, outperforming AIM by up to 10% classification accuracy and 28x speed on high-order correlation datasets under differential privacy.

  5. Private Adaptive Covariance Estimation via Gaussian Graphical Models

    cs.LG 2026-05 unverdicted novelty 6.0

    PACE-GGM selects poorly approximated covariance entries, measures them privately, and reconstructs the full matrix with a maximum-entropy objective to produce a Gaussian graphical model, yielding lower estimation erro...

  6. Aim High, Stay Private: Differentially Private Synthetic Data Enables Public Release of Behavioral Health Information with High Utility

    cs.CR 2025-06 unverdicted novelty 4.0

    The authors apply the Adaptive Iterative Mechanism to create differentially private synthetic data from the LEMURS wearable and survey dataset and show that epsilon=5 retains useful predictive performance for downstre...

  7. Decoupling Identity from Utility: Privacy-by-Design Frameworks for Financial Ecosystems

    cs.CE 2026-04 unverdicted novelty 2.0

    Differentially private synthetic data and seeded agent-based models can separate personal identities from usable financial data while meeting regulatory privacy rules.