Pith. sign in

REVIEW 3 major objections 5 minor 71 references

What's Wrong with Your Synthetic Tabular Data? Using Explainable AI to Evaluate Generative Models

T0 review · 3 major / 5 minor · reviewed 2026-08-16 · deepseek-v4-flash

Pith's one-line read Explainable AI can show exactly why synthetic tabular data look wrong.

desk verdict A genuinely useful diagnostic toolkit for synthetic tabular data, but the headline claim that XAI reveals generator flaws rather than detector artifacts is asserted, not yet demonstrated. read the letter →

arxiv 2504.20687 v1 pith:SX7TSS2C submitted 2025-04-29 cs.LG stat.ML

classification cs.LGstat.ML
keywords syntheticdataqualitygenerativeartificialintelligenceexplainableinterpretablemachinelearningdetectiontabularShapleyvaluescounterfactualexplanations
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Synthetic tabular data are usually graded with aggregate scores—statistical distances, utility measures, and detection accuracy—that can disagree and never say where generation failed. This paper proposes training a binary classifier to distinguish real from synthetic rows and then using explainable-AI tools on that classifier: permutation feature importance, partial dependence and ICE plots, Shapley values, and counterfactual explanations. The result is a feature-level audit that localizes unrealistic values, broken feature dependencies, and under- or over-represented regions of the data distribution. Demonstrations on two tabular datasets show the approach surfacing weaknesses that conventional quality metrics overlook.

What carries the argument

The load-bearing object is the detection classifier, a binary model $C$ mapping each row to its estimated probability of being real, trained on labeled real and synthetic data. It converts the unsupervised problem of judging a generative model into a supervised classification problem that XAI methods can address. Four families of explanations carry the argument: permutation feature importance and global Shapley values identify the features and interactions that separate real from synthetic; partial dependence and individual conditional expectation plots locate value regions where the classifier confidently flags synthetic rows; marginal and conditional Shapley values decompose individual predictions, with the conditional version respecting feature dependencies; and counterfactual explanations compute minimal, plausible feature changes that flip a synthetic row's classification to real. The qualitative distinction between marginal ('true to the model') and conditional ('true to the data') explanations is what lets the authors attribute a detected flaw to the generator rather than to the classifier's independence assumptions.

What would settle it

Run a controlled experiment with an injected flaw: take a real tabular dataset, fit a generator, then deliberately break one known property—for example, randomizing one feature's values or severing one documented dependency—in a new synthetic sample. If the detection-plus-XAI pipeline does not rank that injected flaw at the top of feature importance and does not show a clear anomaly in the corresponding effect plot or Shapley decomposition, the claim that these tools reveal generator weaknesses is refuted.

Watch

Extended reading notes

Core claim

The central claim is that a well-trained real-versus-synthetic detection classifier is not just a quality score: it is a supervised proxy whose explanations reveal why synthetic data are distinguishable. On the paper's own terms, the classifier answers four questions: which features and dependencies were hardest for the generator, how the generator behaves in low- and high-density regions, which features make individual synthetic or real rows look wrong, and which minimal changes would make a detected synthetic row look real. The authors show that global tools (permutation feature importance, Shapley feature and interaction importance, partial dependence and ICE plots) expose weak spots such as non-integer values in an integer feature, rare classes that are under-represented, and interactions that the generator does not retain. Local Shapley analysis further shows that a synthetic row can fail because of an implausible combination of individually plausible values, for instance a very young person with a school-leaving age, and counterfactual edits show the small changes needed to make that row pass as real. Conventional metrics, they argue, would report only that the synthetic data differ, not where or why.

Load-bearing premise

The whole diagnostic chain rests on one premise: the detection classifier is a trustworthy proxy for synthetic data quality, so a low accuracy means either a weak classifier or genuinely good synthetic data and the explanations reflect generator flaws rather than classifier artifacts.

Editorial extensions

If this is right

  • Feature-importance rankings become a targeted debugging list: a generator's weak spots are the features and interactions the detector leans on most.
  • Partial-dependence and ICE plots turn quality assessment into a density-coverage map, showing which real-data regions the synthetic data over- or under-represent.
  • Local Shapley decompositions identify the specific value combinations that make an individual synthetic row look implausible, even when each feature alone looks fine.
  • Counterfactual edits give an actionable repair: for a flagged synthetic row, the minimal changes that make it pass as real indicate what the generator got wrong.
  • The same workflow is transferable across generators and datasets, so a fixed audit pipeline can compare two synthesizers or monitor one as it is modified.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural extension is to train the detector on real data the generator never saw, turning the same diagnostics into a privacy or generalization audit; the paper mentions this as future work.
  • The diagnostic plots could serve as regression tests in generator development: after a change, a regenerate-and-compare step would check whether the flagged PDP dip or interaction importance disappears.
  • Implicit in the worked examples is a practical rule: when features are locally dependent, prefer conditional Shapley values over marginal ones, because marginal attributions can blame the wrong feature for an unrealistic combination.
  • The counterfactual output could be reused as a data-cleaning prescription for individual synthetic rows, not only as a diagnosis of the generator.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper proposes an evaluation framework for synthetic tabular data in which a binary classifier is trained to distinguish real from synthetic observations, and explainable AI methods are then applied to that classifier to explain why the synthetic data are distinguishable. The authors map four XAI tools to four diagnostic questions: permutation feature importance and Shapley values for challenging features and dependencies (Q1), partial dependence and ICE curves for unrealistic regions and over/underrepresented areas (Q2), Shapley decompositions for individual real and synthetic instances (Q3), and counterfactual explanations for minimal changes that would make a synthetic instance look real (Q4). The approach is demonstrated on the Adult dataset with TabSyn and, in an appendix, on the Nursery dataset with CTGAN. The central claim is that this XAI-on-detector pipeline provides deeper insight than conventional synthetic-data quality metrics and uncovers issues that standard evaluation techniques overlook.

Significance. If the central claim were fully established, the framework would be a practically useful addition to the synthetic-data auditing toolbox, because it moves beyond scalar quality scores toward feature- and instance-level diagnoses. The paper has real strengths: it gives a clean mapping from diagnostic questions to specific XAI tools, it uses a sensible detection model (tuned XGBoost) and compares several classifier families, it discusses the important distinction between marginal and conditional explanations, and it ships a public repository with scripts for tuning, training, and reproduction. The case studies are internally coherent and the XAI computations follow standard practice. However, the headline contribution is an empirical claim about explanatory depth relative to conventional metrics, and that claim is not yet backed by the experiments as written.

major comments (3)
  1. [Abstract; Section 5] The abstract and Section 5 state that the approach 'uncovers issues overlooked by standard evaluation techniques,' but the experiments contain no comparison to conventional quality metrics such as maximum mean discrepancy, Wasserstein distance, precision/recall, or utility-based measures. Section 5.1 compares detection classifiers against each other, not against standard evaluation metrics, and Sections 5.2 and Appendix A present only the XAI-based diagnostics. Without a side-by-side demonstration that standard metrics fail to flag the education_num non-integer pattern, the occupation rare-class issue, or the class-dependency issue in Nursery, the claimed advantage over standard evaluation techniques is not demonstrated. I request an experiment that computes at least one or two standard fidelity/utility metrics on the same synthetic datasets and explicitly compares what those metrics indicate with what the XAI diagnostics indicate.
  2. [Section 6; Section 4.2.2] The pipeline attributes detector explanations to flaws of the generative model, but this attribution is assumed rather than validated. Section 6 itself concedes that the detector 'can be too sensitive and might detect deviations such as different numeric precision which might not be relevant to assess the practical utility of the synthetic data.' The Adult example interprets the periodic PDP dips for education_num as evidence that TabSyn generates non-integer values; this is plausible, but nothing in the experiments verifies that the highlighted pattern is a generator flaw rather than a detector artifact. The paper would be substantially strengthened by a validation study, for example by injecting controlled flaws into a generator and checking whether the XAI diagnostics recover them, or by repairing a diagnosed issue (e.g., rounding education_num to integers) and showing that a conventional fidelity or utility metric improves. Without such validation, 'what is wrong with the synthetic data' is operationally only 'what the chosen detector exploits.'
  3. [Section 4.2.1; Section 5.2.1] The feature-level conclusions are based on a single detector family (XGBoost), but PFI and TreeSHAP are known to reflect the model's internal structure as well as the data distribution. Section 5.1 shows that XGBoost has higher detection accuracy than logistic regression and random forest, but it does not examine whether the explanations are stable across detector choices. Since the central claim is that the XAI diagnostics reveal generator weaknesses rather than detector artifacts, I ask for a sensitivity analysis in which at least the global importance ranking and the PDP for education_num are recomputed with a different high-performing detector (e.g., a tuned random forest or a regularized logistic regression with engineered features) and the agreement or disagreement of the diagnostic conclusions is reported.
minor comments (5)
  1. [Figure 3b] The class label 'unknwon' on the y-axis appears to be a typo for 'unknown.'
  2. [Section 5.2.4] The text reads '5× 105 Monte Carlo samples'; this should presumably be 5×10^5 (or 500,000) Monte Carlo samples.
  3. [Figures 2b and 8b] The x-axis label 'degree 1 2' is ambiguous; it would be clearer to write 'Degree 1' and 'Degree 2' as separate legend entries or to explain the degrees in the caption.
  4. [Section 5.2.3] The conditional Shapley values are estimated with conditional inference trees, but the paper does not state the hyperparameter settings or the number of trees used for this estimator; a brief reproducibility note would be useful.
  5. [Section 5.2.2] The interpretation of the ICE curves as indicating 'low fidelity but high diversity' for education_num is somewhat compressed; since this is a key illustrative conclusion, one or two sentences explaining how the relative shares of real and synthetic ICE curves below/above 0.5 map to fidelity and diversity would improve readability.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: the proposed XAI-on-detector evaluation is self-contained, and the acknowledged detector-dependence and use of generator-based XAI tools are stated limitations rather than reductions.

full rationale

The paper's central method is to train a binary detector to separate real and synthetic data and then explain its predictions with PFI, PDP/ICE, Shapley values, and counterfactuals. This is an empirical demonstration on two datasets, not a derivation that reduces to its own inputs by construction: no fitted parameter is renamed as a prediction, no uniqueness theorem from the authors' prior work is invoked to force a choice, and no equation equates the XAI output with the claimed conclusion. The only author-overlap citations are to externally published methods: conditional sampling in [17], MCCE counterfactuals in [21], and conditional inference trees in [71]. These are used as tools with published code and peer review, and they are not the object being evaluated. The paper explicitly flags its real dependency in Section 6: it 'depends on the performance of a binary classifier used for synthetic data detection,' and 'some of the XAI methods, especially conditional approaches and counterfactuals generators, are even based on generative modeling themselves.' Those are honest limitations about validity and sensitivity, not circular reductions. The lack of ground-truth validation that a highlighted detector artifact corresponds to an actual generator flaw is a correctness risk, not circularity, because the paper never equates its explanations with a fitted outcome by construction. The low score reflects only the presence of minor non-load-bearing self-citations to methods whose authors overlap with the present paper.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

No new entities are introduced. The method relies on standard XAI and tree models; the central claim rests on the detector-as-proxy assumption and on the accuracy of the XAI approximations.

assumptions (3)
  • domain assumption A well-tuned binary classifier trained to distinguish real from synthetic rows provides a valid measure of synthetic data quality.
    Section 4.1; the paper notes in the Discussion that the approach depends on the classifier's performance, but the methodology relies on this proxy assumption.
  • domain assumption XAI explanations of the detector reflect properties of the generative model rather than artifacts of the detector itself.
    Section 4.2 and Section 6; the interpretive leap from model explanations to generator deficiencies is central and is only partially validated.
  • domain assumption The XAI estimators used are accurate enough for the qualitative conclusions.
    KernelSHAP with 2000 coalitions, conditional inference trees, and MCCE with 5e5 Monte Carlo samples are approximations whose estimation error is not quantified (Sections 5.2.3 and 5.2.4).

how reviews work

0 comments
Cite this review

Pith. "Pith review of What's Wrong with Your Synthetic Tabular Data? Using Explainable AI to Evaluate Generative Models." pith.science (2026). https://pith.science/paper/SX7TSS2C

@misc{pith2026250420687,
  author       = {Pith},
  title        = {Pith review of: What's Wrong with Your Synthetic Tabular Data? Using Explainable AI to Evaluate Generative Models},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/SX7TSS2C}},
  note         = {Machine review of arXiv:2504.20687}
}
read the original abstract

Evaluating synthetic tabular data is challenging, since they can differ from the real data in so many ways. There exist numerous metrics of synthetic data quality, ranging from statistical distances to predictive performance, often providing conflicting results. Moreover, they fail to explain or pinpoint the specific weaknesses in the synthetic data. To address this, we apply explainable AI (XAI) techniques to a binary detection classifier trained to distinguish real from synthetic data. While the classifier identifies distributional differences, XAI concepts such as feature importance and feature effects, analyzed through methods like permutation feature importance, partial dependence plots, Shapley values and counterfactual explanations, reveal why synthetic data are distinguishable, highlighting inconsistencies, unrealistic dependencies, or missing patterns. This interpretability increases transparency in synthetic data evaluation and provides deeper insights beyond conventional metrics, helping diagnose and improve synthetic data quality. We apply our approach to two tabular datasets and generative models, showing that it uncovers issues overlooked by standard evaluation techniques.

Figures

Figures reproduced from arXiv: 2504.20687 by the authors.

Figure 1
Figure 1. (a) Synthetic data detection performance of logistic regression, random forest [69] and XGBoost models [PITH_FULL_IMAGE:figures/full_fig_p007_1.png] view at source ↗
Figure 2
Figure 2. Feature importance values for synthetic data detection with XGBoost for ten TabSyn-generated synthetic [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗
Figure 3
Figure 3. ICE/PDP for synthetic data detection with XGBoost for TabSyn-generated synthetic adult data. (a) Numeric [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figures from the paper (8 more)
Figure 4
Figure 4. Figure 4: Force plots for conditional and marginal Shapley values decomposing the XGBoost prediction for an exem [PITH_FULL_IMAGE:figures/full_fig_p010_4.png]
Figure 5
Figure 5. Figure 5: Waterfall plots for Shapley interaction values decomposing the XGBoost prediction for an examplary [PITH_FULL_IMAGE:figures/full_fig_p010_5.png]
Figure 6
Figure 6. Figure 6: Force and waterfall plots for, respectively, (a) conditional Shapley values and (b) Shapley interaction values [PITH_FULL_IMAGE:figures/full_fig_p011_6.png]
Figure 7
Figure 7. Figure 7: Four counterfactual explanations for an examplary instance of TabSyn-generated synthetic adult data. High [PITH_FULL_IMAGE:figures/full_fig_p012_7.png]
Figure 8
Figure 8. Figure 8: Feature importance values for synthetic data detection with XGBoost for ten CTGAN-generated synthetic [PITH_FULL_IMAGE:figures/full_fig_p017_8.png]
Figure 9
Figure 9. Figure 9: ICE/PDP for synthetic data detection with XGBoost for CTGAN-generated synthetic nursery data. (a) [PITH_FULL_IMAGE:figures/full_fig_p017_9.png]
Figure 10
Figure 10. Figure 10: Waterfall plots for Shapley interaction values decomposing the XGBoost prediction for an examplary [PITH_FULL_IMAGE:figures/full_fig_p018_10.png]
Figure 11
Figure 11. Figure 11: Four counterfactual explanations for an examplary instance of CTGAN-generated synthetic nursery data. [PITH_FULL_IMAGE:figures/full_fig_p018_11.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

71 extracted references · 52 canonical work pages

  1. [1]

    Attention is all you need

    Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Ł ukasz Kaiser, and Illia Polosukhin. Attention is all you need. In Advances in Neural Information Processing Systems, volume 30, 2017

  2. [2]

    Denoising diffusion probabilistic models

    Jonathan Ho, Ajay Jain, and Pieter Abbeel. Denoising diffusion probabilistic models. In Advances in Neural Information Processing Systems, volume 33, pages 6840–6851, 2020

  3. [3]

    Score- based generative modeling through stochastic differential equations

    Yang Song, Jascha Sohl-Dickstein, Diederik P Kingma, Abhishek Kumar, Stefano Ermon, and Ben Poole. Score- based generative modeling through stochastic differential equations. In International Conference on Learning Representations, 2021

  4. [4]

    Synthetic data–what, why and how? arXiv preprint arXiv:2205.03257, 2022

    James Jordon, Lukasz Szpruch, Florimond Houssiau, Mirko Bottarelli, Giovanni Cherubin, Carsten Maple, Samuel N Cohen, and Adrian Weller. Synthetic data–what, why and how? arXiv preprint arXiv:2205.03257, 2022

  5. [5]

    Revisiting classifier two-sample tests

    David Lopez-Paz and Maxime Oquab. Revisiting classifier two-sample tests. In International Conference on Learning Representations, 2017

  6. [6]

    How faithful is your synthetic data? Sample-level metrics for evaluating and auditing generative models

    Ahmed Alaa, Boris Van Breugel, Evgeny S Saveliev, and Mihaela van der Schaar. How faithful is your synthetic data? Sample-level metrics for evaluating and auditing generative models. In International Conference on Machine Learning, volume 162 of PMLR, pages 290–306, 2022

  7. [7]

    Explainable generative Ai (GenXAI): A survey, conceptualization, and research agenda

    Johannes Schneider. Explainable generative Ai (GenXAI): A survey, conceptualization, and research agenda. Artificial Intelligence Review, 57(11):289, 2024

  8. [8]

    beta-V AE: Learning basic visual concepts with a constrained variational frame- work

    Irina Higgins, Loic Matthey, Arka Pal, Christopher Burgess, Xavier Glorot, Matthew Botvinick, Shakir Mo- hamed, and Alexander Lerchner. beta-V AE: Learning basic visual concepts with a constrained variational frame- work. In International Conference on Learning Representations, 2017

Show all 71 references
  1. [9]

    InfoGAN: Interpretable representation learning by information maximizing generative adversarial nets

    Xi Chen, Yan Duan, Rein Houthooft, John Schulman, Ilya Sutskever, and Pieter Abbeel. InfoGAN: Interpretable representation learning by information maximizing generative adversarial nets. In Advances in Neural Informa- tion Processing Systems, volume 29, 2016

  2. [10]

    Trade-offs in fine-tuned diffusion models between accuracy and interpretability

    Mischa Dombrowski, Hadrien Reynaud, Johanna P Müller, Matthew Baugh, and Bernhard Kainz. Trade-offs in fine-tuned diffusion models between accuracy and interpretability. Proceedings of the AAAI Conference on Artificial Intelligence, 38(19):21037–21045, 2024

  3. [11]

    Quantifying attention flow in transformers

    Samira Abnar and Willem Zuidema. Quantifying attention flow in transformers. In Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, pages 4190–4197, 2020

  4. [12]

    A multiscale visualization of attention in the transformer model

    Jesse Vig. A multiscale visualization of attention in the transformer model. In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics: System Demonstrations, pages 37–42, 2019

  5. [13]

    xAI-GAN: Enhancing generative adversarial networks via explainable AI systems

    Vineel Nagisetty, Laura Graves, Joseph Scott, and Vijay Ganesh. xAI-GAN: Enhancing generative adversarial networks via explainable AI systems. arXiv preprint arXiv:2002.10438, 2020

  6. [14]

    Activation maximization generative adversarial nets

    Zhiming Zhou, Han Cai, Shu Rong, Yuxuan Song, Kan Ren, Weinan Zhang, Jun Wang, and Yong Yu. Activation maximization generative adversarial nets. In International Conference on Learning Representations, 2018

  7. [15]

    Synthesizing the preferred inputs for neurons in neural networks via deep generator networks

    Anh Nguyen, Alexey Dosovitskiy, Jason Yosinski, Thomas Brox, and Jeff Clune. Synthesizing the preferred inputs for neurons in neural networks via deep generator networks. InAdvances in Neural Information Processing Systems, volume 29, 2016

  8. [16]

    Katsaggelos

    Amil Dravid, Florian Schiffers, Boqing Gong, and Aggelos K. Katsaggelos. medXGAN: Visual explanations for medical classifiers through a generative latent space. In 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), pages 2935–2944, 2022

  9. [17]

    Conditional feature importance with generative modeling using adversarial random forests

    Kristin Blesch, Niklas Koenen, Jan Kapar, Pegah Golchian, Lukas Burk, Markus Loecher, and Marvin N Wright. Conditional feature importance with generative modeling using adversarial random forests. arXiv preprint arXiv:2501.11178, 2025. 13 What’s Wrong with Your Synthetic Tabular Data?

  10. [18]

    Explaining image classifiers by removing input features using generative models

    Chirag Agarwal and Anh Nguyen. Explaining image classifiers by removing input features using generative models. In Computer Vision – ACCV 2020, pages 101–118, 2020

  11. [19]

    CounteRGAN: Generating counterfactuals for real-time recourse and interpretability using residual gans

    Daniel Nemirovsky, Nicolas Thiebaut, Ye Xu, and Abhishek Gupta. CounteRGAN: Generating counterfactuals for real-time recourse and interpretability using residual gans. In Proceedings of the Thirty-Eighth Conference on Uncertainty in Artificial Intelligence, volume 180 of PMLR,...

  12. [20]

    CountARFactuals – generating plausible model-agnostic counterfactual explanations with adversarial random forests

    Susanne Dandl, Kristin Blesch, Timo Freiesleben, Gunnar König, Jan Kapar, Bernd Bischl, and Marvin N Wright. CountARFactuals – generating plausible model-agnostic counterfactual explanations with adversarial random forests. In Explainable Artificial Intelligence, pages 85–107, 2024

  13. [21]

    MCCE: Monte carlo sampling of valid and realistic counterfactual explanations for tabular data

    Annabelle Redelmeier, Martin Jullum, Kjersti Aas, and Anders Løland. MCCE: Monte carlo sampling of valid and realistic counterfactual explanations for tabular data. Data Mining and Knowledge Discovery , 38(4):1830–1861, 2024

  14. [22]

    Tabular data generation: Can we fool XGBoost ? In NeurIPS 2022 First Table Representation Workshop, 2022

    EL Hacen Zein and Tanguy Urvoy. Tabular data generation: Can we fool XGBoost ? In NeurIPS 2022 First Table Representation Workshop, 2022

  15. [23]

    CIFAKE: Image classification and explainable identification of AI-generated synthetic images

    Jordan J Bird and Ahmad Lotfi. CIFAKE: Image classification and explainable identification of AI-generated synthetic images. IEEE Access, 12:15642–15650, 2024

  16. [24]

    Detecting deepfake images using deep learning techniques and explainable AI methods

    Wahidul Hasan Abir, Faria Rahman Khanam, Kazi Nabiul Alam, Myriam Hadjouni, Hela Elmannai, Sami Bourouis, Rajesh Dey, and Mohammad Monirujjaman Khan. Detecting deepfake images using deep learning techniques and explainable AI methods. Intelligent Automation & Soft Computing, 3...

  17. [25]

    Samah S Baraheem and Tam V Nguyen. AI vs. AI: Can AI detect AI-generated images? Journal of Imaging, 9(10):199, 2023

  18. [26]

    Learning in implicit generative models

    Shakir Mohamed and Balaji Lakshminarayanan. Learning in implicit generative models. arXiv preprint arXiv:1610.03483, 2016

  19. [27]

    Auto-encoding variational bayes

    Diederik P Kingma and Max Welling. Auto-encoding variational bayes. InInternational Conference on Learning Representations, 2014

  20. [28]

    Generative adversarial nets

    Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. Generative adversarial nets. In Advances in Neural Information Processing Systems, volume 27, 2014

  21. [29]

    Variational inference with normalizing flows

    Danilo Rezende and Shakir Mohamed. Variational inference with normalizing flows. In Proceedings of the 32nd International Conference on Machine Learning, volume 37 of PMLR, pages 1530–1538, 2015

  22. [30]

    A neural probabilistic language model

    Yoshua Bengio, Réjean Ducharme, and Pascal Vincent. A neural probabilistic language model. In Advances in Neural Information Processing Systems, volume 13, 2000

  23. [31]

    Sam Bond-Taylor, Adam Leach, Yang Long, and Chris G Willcocks. Deep generative modelling: A comparative review of vaes, gans, normalizing flows, energy-based and autoregressive models.IEEE Transactions on Pattern Analysis and Machine Intelligence, 44(11):7327–7347, 2022

  24. [32]

    Modeling tabular data using conditional GAN

    Lei Xu, Maria Skoularidou, Alfredo Cuesta-Infante, and Kalyan Veeramachaneni. Modeling tabular data using conditional GAN. In Advances in Neural Information Processing Systems, volume 32, 2019

  25. [33]

    TabDDPM: Modelling tabular data with diffusion models

    Akim Kotelnikov, Dmitry Baranchuk, Ivan Rubachev, and Artem Babenko. TabDDPM: Modelling tabular data with diffusion models. In Proceedings of the 40th International Conference on Machine Learning, volume 202 of PMLR, pages 17564–17579, 2023

  26. [34]

    Tabula: Harnessing language models for tabular data synthesis

    Zilong Zhao, Robert Birke, and Lydia Chen. Tabula: Harnessing language models for tabular data synthesis. arXiv preprint arXiv:2310.12746, 2023

  27. [35]

    Raab, and Chris Dibben

    Beata Nowok, Gillian M. Raab, and Chris Dibben. synthpop: Bespoke creation of synthetic data in R. Journal of Statistical Software, 74(11):1–26, 2016

  28. [36]

    Adversarial random forests for density esti- mation and generative modeling

    David S Watson, Kristin Blesch, Jan Kapar, and Marvin N Wright. Adversarial random forests for density esti- mation and generative modeling. In Proceedings of The 26th International Conference on Artificial Intelligence and Statistics, volume 206 of PMLR, pages 5357–5375, 2023

  29. [37]

    Synthcity: Facilitating innovative use cases of synthetic data in different data modalities

    Zhaozhi Qian, Bogdan-Constantin Cebere, and Mihaela van der Schaar. Synthcity: Facilitating innovative use cases of synthetic data in different data modalities. arXiv preprint arXiv:2301.07573, 2023

  30. [38]

    An evaluation of synthetic data generators implemented in the Python library synthcity

    Emma Fössing and Jörg Drechsler. An evaluation of synthetic data generators implemented in the Python library synthcity. In Privacy in Statistical Databases, pages 178–193, 2024. 14 What’s Wrong with Your Synthetic Tabular Data?

  31. [39]

    Why do tree-based models still outperform deep learning on typical tabular data? In Advances in Neural Information Processing Systems , volume 35, pages 507–520, 2022

    Léo Grinsztajn, Edouard Oyallon, and Gaël Varoquaux. Why do tree-based models still outperform deep learning on typical tabular data? In Advances in Neural Information Processing Systems , volume 35, pages 507–520, 2022

  32. [40]

    Deep neural networks and tabular data: A survey

    Vadim Borisov, Tobias Leemann, Kathrin Seßler, Johannes Haug, Martin Pawelczyk, and Gjergji Kasneci. Deep neural networks and tabular data: A survey. IEEE Transactions on Neural Networks and Learning Systems , 35(6):7499–7519, 2024

  33. [41]

    Tabular data: Deep learning is not all you need

    Ravid Shwartz-Ziv and Amitai Armon. Tabular data: Deep learning is not all you need. Information Fusion, 81:84–90, 2022

  34. [42]

    TabPFN: A transformer that solves small tabular classification problems in a second

    Noah Hollmann, Samuel Müller, Katharina Eggensperger, and Frank Hutter. TabPFN: A transformer that solves small tabular classification problems in a second. In NeurIPS 2022 First Table Representation Workshop, 2022

  35. [43]

    Mixed-type tabular data synthesis with score-based diffusion in latent space

    Hengrui Zhang, Jiani Zhang, Zhengyuan Shen, Balasubramaniam Srinivasan, Xiao Qin, Christos Faloutsos, Huzefa Rangwala, and George Karypis. Mixed-type tabular data synthesis with score-based diffusion in latent space. In International Conference on Learning Representations, 2024

  36. [44]

    A note on the evaluation of generative models

    L Theis, A van den Oord, and M Bethge. A note on the evaluation of generative models. In International Conference on Learning Representations, 2016

  37. [45]

    Assessing generative models via precision and recall

    Mehdi SM Sajjadi, Olivier Bachem, Mario Lucic, Olivier Bousquet, and Sylvain Gelly. Assessing generative models via precision and recall. In Advances in Neural Information Processing Systems, volume 31, 2018

  38. [46]

    A practical guide to sample-based statistical distances for evaluating generative models in science

    Sebastian Bischoff, Alana Darcher, Michael Deistler, Richard Gao, Franziska Gerken, Manuel Gloeckler, Lisa Haxel, Jaivardhan Kapoor, Janne K Lappalainen, Jakob H Macke, et al. A practical guide to sample-based statistical distances for evaluating generative models in science. ...

  39. [47]

    Interpretable Machine Learning

    Christoph Molnar. Interpretable Machine Learning. 2 edition, 2022

  40. [48]

    Scholbeck, Giuseppe Casalicchio, Moritz Grosse-Wentrup, and Bernd Bischl

    Christoph Molnar, Gunnar König, Julia Herbinger, Timo Freiesleben, Susanne Dandl, Christian A. Scholbeck, Giuseppe Casalicchio, Moritz Grosse-Wentrup, and Bernd Bischl. General pitfalls of model-agnostic interpre- tation methods for machine learning models. In International Wo...

  41. [49]

    A unified approach to interpreting model predictions

    Scott M Lundberg and Su-In Lee. A unified approach to interpreting model predictions. In Advances in Neural Information Processing Systems, volume 30, 2017

  42. [50]

    Consistent individualized feature attribution for tree ensem- bles

    Scott M Lundberg, Gabriel G Erion, and Su-In Lee. Consistent individualized feature attribution for tree ensem- bles. arXiv preprint arXiv:1802.03888, 2018

  43. [51]

    Greedy function approximation: a gradient boosting machine

    Jerome H Friedman. Greedy function approximation: a gradient boosting machine. Annals of Statistics , 29(5):1189–1232, 2001

  44. [52]

    Peeking inside the black box: Visualizing statisti- cal learning with plots of individual conditional expectation

    Justin Bleich Alex Goldstein, Adam Kapelner and Emil Pitkin. Peeking inside the black box: Visualizing statisti- cal learning with plots of individual conditional expectation. Journal of Computational and Graphical Statistics, 24(1):44–65, 2015

  45. [53]

    All models are wrong, but many are useful: Learning a variable’s importance by studying an entire class of prediction models simultaneously

    Aaron Fisher, Cynthia Rudin, and Francesca Dominici. All models are wrong, but many are useful: Learning a variable’s importance by studying an entire class of prediction models simultaneously. Journal of Machine Learning Research, 20(177):1–81, 2019

  46. [54]

    Explaining individual predictions when features are dependent: More accurate approximations to Shapley values

    Kjersti Aas, Martin Jullum, and Anders Løland. Explaining individual predictions when features are dependent: More accurate approximations to Shapley values. Artificial Intelligence, 298:103502, 2021

  47. [55]

    Algorithms to estimate Shapley value feature attributions

    Hugh Chen, Ian C Covert, Scott M Lundberg, and Su-In Lee. Algorithms to estimate Shapley value feature attributions. Nature Machine Intelligence, 5(6):590–601, 2023

  48. [56]

    Janizek, Scott Lundberg, and Su-In Lee

    Hugh Chen, Joseph D. Janizek, Scott Lundberg, and Su-In Lee. True to the model or true to the data? arXiv preprint arXiv:2006.16234, 2020

  49. [57]

    Revisiting precision recall definition for generative modeling

    Loic Simon, Ryan Webster, and Julien Rabin. Revisiting precision recall definition for generative modeling. In Proceedings of the 36th International Conference on Machine Learning, volume 97 of PMLR, pages 5799–5808, 2019

  50. [58]

    XGBoost: A scalable tree boosting system

    Tianqi Chen and Carlos Guestrin. XGBoost: A scalable tree boosting system. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’16, page 785–794, 2016

  51. [59]

    Watson and Marvin N

    David S. Watson and Marvin N. Wright. Testing conditional independence in supervised learning algorithms. Machine Learning, 110:2107 – 2129, 2021. 15 What’s Wrong with Your Synthetic Tabular Data?

  52. [60]

    A value for n-person games

    Lloyd S Shapley. A value for n-person games. In Harold W. Kuhn and Albert W. Tucker, editors, Contributions to the Theory of Games, pages 307–317. Princeton University Press, Princeton, 1953

  53. [61]

    Visualizing the effects of predictor variables in black box supervised learning models

    Daniel W Apley and Jingyu Zhu. Visualizing the effects of predictor variables in black box supervised learning models. Journal of the Royal Statistical Society Series B: Statistical Methodology, 82(4):1059–1086, 2020

  54. [62]

    The shapley taylor interaction index

    Mukund Sundararajan, Kedar Dhamdhere, and Ashish Agarwal. The shapley taylor interaction index. In Pro- ceedings of the 37th International Conference on Machine Learning , volume 119 of PMLR, pages 9259–9268, 13–18 Jul 2020

  55. [63]

    Counterfactual explanations and how to find them: literature review and benchmarking

    Riccardo Guidotti. Counterfactual explanations and how to find them: literature review and benchmarking. Data Mining and Knowledge Discovery, 38(5):2770–2824, 2024

  56. [64]

    Barry Becker and Ronny Kohavi. Adult. UCI Machine Learning Repository, 1996

  57. [65]

    Vladislav Rajkovic. Nursery. UCI Machine Learning Repository, 1989

  58. [66]

    CTAB-GAN+: Enhancing tabular data synthesis

    Zilong Zhao, Aditya Kunar, Robert Birke, Hiek Van der Scheer, and Lydia Y Chen. CTAB-GAN+: Enhancing tabular data synthesis. Frontiers in Big Data, 6:1296508, 2024

  59. [67]

    Uci machine learning repository, 2017

    Dheeru Dua and Casey Graff. Uci machine learning repository, 2017

  60. [68]

    Kaggle datasets repository

    Kaggle. Kaggle datasets repository. Accessed: 2025-02-19

  61. [69]

    Random forests

    Leo Breiman. Random forests. Machine learning, 45:5–32, 2001

  62. [70]

    Unifying feature-based explanations with functional ANOV A and cooperative game theory

    Fabian Fumagalli, Maximilian Muschalik, Eyke Hüllermeier, Barbara Hammer, and Julia Herbinger. Unifying feature-based explanations with functional ANOV A and cooperative game theory. In The 28th International Conference on Artificial Intelligence and Statistics, 2025

  63. [71]

    Explaining predictive models with mixed features us- ing shapley values and conditional inference trees

    Annabelle Redelmeier, Martin Jullum, and Kjersti Aas. Explaining predictive models with mixed features us- ing shapley values and conditional inference trees. In ICross-Domain Conference for Machine Learning and Knowledge Extraction, pages 117–137, 2020. 16 What’s Wrong with Y...

Pith tools

Reviewed August 16, 2026 · model on record in the stance chip above.