The Flow has not summarised this story yet — read it at arXiv Machine Learning.
arXiv:2507. 19700v2 Announce Type: replace Abstract: We propose a new framework for generating tabular synthetic datasets via disjoint generative models.
arXiv:2606. 08259v1 Announce Type: new Abstract: This paper investigates the problem of generating synthetic tabular data with differential privacy (DP) guarantees, enabling data sharing in sensitive domains.
The paper compares data-level and training-level methods for balancing language model capability and privacy leakage on synthetic medical records with embedded canaries. Direct finetuning achieves the highest capability but leaks the most private information, while DP‑SGD reduces leakage at a significant cost to performance. Generating privacy‑aware synthetic data—especially with uniqueness‑aware rewriting—offers a better trade‑off, and more capable rewriting models tend to lower downstream privacy risks, though gains are inconsistent with increased compute.
Efficient Provably Private Classification with a Tabular Foundation Model introduces PrivTab, a tabular foundation model that embeds differential privacy directly into its architecture. Pretrained on simulated datasets, PrivTab uses in-context learning to convert sensitive rows into compact, provably private summaries, enabling a single forward pass for classification. The model outperforms private linear and neural‑network baselines under moderate-to-strong privacy, shows negligible membership leakage, maintains well‑calibrated predictions, and reduces dataset fitting time by 10,000×.
arXiv:2603. 19258v2 Announce Type: replace-cross Abstract: Differentially private (DP) fine-tuning of large language models (LLMs) requires massive compute and full model access, which rules out state-of-the-art proprietary APIs for general users.
GENSCRIPT is an inference‑only pipeline that generates synthetic data without training a generative model. It creates a deterministic statistical profile of the source data, uses a language model to infer field semantics and cross‑column constraints, and then compiles these into an executable sampler that works for single‑table, temporal, and relational data. The method builds generators in minutes, samples large datasets quickly, and achieves fidelity comparable to leading methods while preserving key data relationships such as 1‑to‑1 mappings and primary‑foreign key constraints.