Skip to content
Book Open access

LCATS: LLM-Guided Constraint-Aware Tabular Data Synthesis

Aug 2026 · Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2 · pp. 2698-2707 · 0 citations · 47 references

TL;DR

This paper proposes LLM-Guided Constraint-Aware Tabular Data Synthesis (LCATS), an end-to-end framework that decouples global distribution modeling from local constraint enforcement and achieves strong overall performance against diffusion-based, LLM-based, and hybrid baselines in ?

Abstract

Tabular data synthesis must satisfy two complementary quality criteria. At the global level, synthetic records must faithfully reproduce the statistical characteristics of the original dataset, including marginal distributions and inter-variable correlations. At the local level, each individual record must satisfy domain-specific logical constraints such as algebraic identities, conditional dependencies, and mutual exclusivity rules. Existing diffusion-based methods excel at global statistical fidelity but frequently violate hard logical constraints, while LLM-based methods offer stronger constraint adherence but suffer from autoregressive distributional drift that degrades global fidelity. In this paper, we propose LLM-Guided Constraint-Aware Tabular Data Synthesis (LCATS), an end-to-end framework that decouples global distribution modeling from local constraint enforcement. LCATS comprises four modules. The Analysis module uses an LLM to discover candidate constraints, encodes them as executable verification scripts, and validates them against the original data to eliminate hallucinated patterns. The Synthesis module employs a diffusion model to generate statistically faithful synthetic data. The Optimization module repairs constraint-violating records through a constrained weighted optimization problem, which dynamically assigns column-level adjustment penalties to minimize distributional distortion. The Evolution module further mitigates distributional distortion through iterative feedback during constraint-aware optimization. Extensive experiments on seven benchmark datasets demonstrate that LCATS achieves strong overall performance against diffusion-based, LLM-based, and hybrid baselines in ?-precision, ?-recall, and downstream predictive performance, while producing zero constraint violations. The code is available at https://github.com/SJTU-DMTai/LCATS.

Read PDF

Similar papers

#machine learning Preprint Sep 2026

SMILE: Bridging Continuous Optimization and Discrete Symbolic Recovery

Symbolic regression (SR) discovers closed-form mathematical expressions from data, offering interpretability beyond black-box models. Existing methods suffer from slow convergence in combinatorial search spaces and lack mechanisms to exploit compositional structure in the data. We introduce SMILE (Sine, Multiplication,...

Mansooreh Montazerin, Antonio Ortega, Ajitesh Srivastava · 0 citations
#machine learning Preprint Aug 2026

SymboLLM-FE: LLM-Accelerated Symbolic Regression for Automated Feature Engineering on Tabular Data

This paper combines symbolic regression with LLMs for feature engineering (SymboLLM-FE) to solve the dual challenges of poor interpretability and numerous iterations by employing a statistical prior-grounded LLM refinement mechanism and single-digit LLM calls.

Zi-Jian Cheng, Zi-Yi Jia, Zhi Zhou et al. · 0 citations
#machine learning Preprint Sep 2026

SleuthBench: Benchmarking Statistical LLM Evaluation Using Tabular Hidden Signals

The Empirical Layer, a set of precomputed statistical artifacts comprising summaries, fitted feature and interaction effects, and dataset descriptions, which exposes candidate patterns for direct inspection is proposed, which raises feature-contribution accuracy from 41.9% to 68.0%.

Jing-Yu Jia, Antoine Remond-Tiedrez, Aaron Alvarez et al. · 0 citations
#machine learning Preprint Sep 2026

Synthesis Without Training: An Inference-Only Pipeline for Tabular, Temporal, and Relational Synthetic Data

Synthetic data generation is dominated by the fit-then-sample paradigm: a generative model is trained on a private dataset and then sampled from. Despite its widespread adoption, this paradigm faces three challenges: (1) a new training run is required for every dataset; (2) different data modalities, such as single tab...

Zi-Long Zhao, Abdul Raheem, Jia-Yu Li et al. · 0 citations
#machine learning Preprint Sep 2026

QuantForge: Discovering Residual Decompositions for MXFP4 Post-Training Quantization

QuantForge is introduced, a PTQ discovery system that records competing explanations, selects controls that distinguish them, and checks that successor code implements the resulting conclusions, improving the discovery of transferable PTQ algorithms by turning controlled evidence into subsequent program changes.

Qiu-Lin Shang, Zhou-Tong Wu, Jie Hu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.