Papers › How Realistic Is Your Synthetic Data? Constraining Deep Generative Models for Tabular Data

How Realistic Is Your Synthetic Data? Constraining Deep Generative Models for Tabular Data

7 Feb 2024arXiv:2402.04823archive 2025-07-28

Mihaela Cătălina Stoian, Salijona Dyrmishi, Maxime Cordy, Thomas Lukasiewicz, Eleonora Giunchiglia

Deep Generative Models (DGMs) have been shown to be powerful tools for generating tabular data, as they have been increasingly able to capture the complex distributions that characterize them. However, to generate realistic synthetic data, it is often not enough to have a good approximation of their distribution, as it also requires compliance with constraints that encode essential background knowledge on the problem at hand. In this paper, we address this limitation and show how DGMs for tabular data can be transformed into Constrained Deep Generative Models (C-DGMs), whose generated samples are guaranteed to be compliant with the given constraints. This is achieved by automatically parsing the constraints and transforming them into a Constraint Layer (CL) seamlessly integrated with the DGM. Our extensive experimental analysis with various DGMs and tasks reveals that standard DGMs often violate constraints, some exceeding 95% non-compliance, while their corresponding C-DGMs are never non-compliant. Then, we quantitatively demonstrate that, at training time, C-DGMs are able to exploit the background knowledge expressed by the constraints to outperform their standard counterparts with up to 6.5% improvement in utility and detection. Further, we show how our CL does not necessarily need to be integrated at training time, as it can be also used as a guardrail at inference time, still producing some improvements in the overall performance of the models. Finally, we show that our CL does not hinder the sample generation time of the models.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2402.04823")

Code

Syntology Ran 10 of 10 code samples harvested from 1 repository linked to this paper; 0 have no recorded run. Of those that ran: 10 ran with no contract checked.

By repository: official repository: 10 samples from 1 repository, 10 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

mihaela-stoian/constraineddgm officialmentioned in paperpytorchApache-2.0 report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

10 samples harvested; 10 ran; 0 honoured the contract we drafted; 0 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

10ran

Licence: 0 of the 10 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from mihaela-stoian/constraineddgm. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

all_div_gt_n mihaela-stoian/constraineddgm/utils.py official repository ran fingerprinted Apache-2.0 (permissive) · 2c0be1f9a20d536d · report
apply_or mihaela-stoian/constraineddgm/constraints/faults.py official repository ran fingerprinted Apache-2.0 (permissive) · ade9519558a21ef8 · report
evaluate_numpy_botnet mihaela-stoian/constraineddgm/constraints/botnet.py official repository ran Apache-2.0 (permissive) · b26964eb404e345b · report
evaluate_numpy_faults mihaela-stoian/constraineddgm/constraints/faults.py official repository ran Apache-2.0 (permissive) · f64fc6cd4c301677 · report
evaluate_numpy_lcld mihaela-stoian/constraineddgm/constraints/lcld.py official repository ran Apache-2.0 (permissive) · 28767778b828cb97 · report
evaluate_numpy_news mihaela-stoian/constraineddgm/constraints/news.py official repository ran Apache-2.0 (permissive) · 23ea68c400dcc59e · report
evaluate_numpy_url mihaela-stoian/constraineddgm/constraints/url.py official repository ran Apache-2.0 (permissive) · 53cf21ac0f5b4f27 · report
evaluate_numpy_wids mihaela-stoian/constraineddgm/constraints/wids.py official repository ran Apache-2.0 (permissive) · 55e2bd38ff6c408b · report
round_func_BPDA mihaela-stoian/constraineddgm/utils.py official repository ran fingerprinted Apache-2.0 (permissive) · df25a2473c298d3a · report
wandb_raw_data mihaela-stoian/constraineddgm/utils.py official repository ran Apache-2.0 (permissive) · 8c96ded74afe1ddc · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections