Pith. sign in

REVIEW 3 cited by

Systematic Assessment of Tabular Data Synthesis

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

arxiv 2402.06806 v3 pith:46JUPCZL submitted 2024-02-09 cs.CR cs.DBcs.LG

classification cs.CRcs.DBcs.LG
keywords datasynthesizerssynthesisprivacyevaluationmetricstabularalgorithms
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Data synthesis has been advocated as an important approach for utilizing data while protecting data privacy. In recent years, a plethora of tabular data synthesis algorithms (i.e., synthesizers) have been proposed. Some synthesizers satisfy Differential Privacy, while others aim to provide privacy in a heuristic fashion. A comprehensive understanding of the strengths and weaknesses of these synthesizers remains elusive due to drawbacks in evaluation metrics and missing head-to-head comparisons of newly developed synthesizers that take advantage of diffusion models and large language models with state-of-the-art statistical synthesizers. In this paper, we present a systematic evaluation framework for assessing tabular data synthesis algorithms. Specifically, we examine and critique existing evaluation metrics, and introduce a set of new metrics in terms of fidelity, privacy, and utility to address their limitations. We conducted extensive evaluations of 8 different types of synthesizers on 12 real-world datasets and identified some interesting findings, which offer new directions for privacy-preserving data synthesis.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. RaMark: Radioactive Watermarking for Generated Tabular Data

    cs.CR 2026-07 conditional novelty 7.0 of 10

    A sinusoidal dependency embedded as part of the tabular distribution remains detectable after generative retraining and data-modification attacks while utility is preserved.

  2. Membership Inference Attacks on Tokenizers of Large Language Models

    cs.CR 2025-10 conditional novelty 5.0 of 10

    Tokenizers leak dataset membership: using distinctive tokens that appear in a dataset's text, an attacker can detect with AUC up to 0.77 whether that dataset was part of tokenizer training.

  3. The Prompt is Mightier than the Example

    cs.LG 2025-05 conditional novelty 5.0 of 10

    Injecting domain knowledge into prompts can substitute for many in-context examples in LLM-based synthetic tabular data generation, cutting required example counts by 40-90%.

Pith tools