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.
By Zilong Zhao, Abdul Raheem, Jiayu Li, Sohei Arisaka, Darius Lim Hong Yi, Milad Abdollahzadeh, Uzair Javaid, Biplab Sikdar
The paper introduces SynEval, a six‑dimensional framework for evaluating multi‑table synthetic data. It assesses per‑column fidelity, multivariate structure (including a new conditional distribution check), cross‑table integrity, machine‑learning utility, privacy protection, and edge‑case robustness. SynEval outputs a unified weighted quality score and is generator‑agnostic, working on any real and synthetic CSV folders with automatic schema inference.
By Aparana Gupta, Anurup Dey, Suyash Dwivedi
arXiv:2608. 08127v1 Announce Type: new Abstract: The runtime of Constraint Programming (CP) solvers is highly sensitive to modeling choices, such as symmetry breaking, implied constraints, global constraints, constraint reformulation, and variable representation.
By Florentina Voboril, Stefan Szeider
arXiv:2406. 08311v3 Announce Type: replace-cross Abstract: Existing evaluations of tabular synthesis models rely primarily on low-order statistics and downstream task performance, leaving multivariate causal relationships that go beyond pairwise correlations largely unmeasured.
By Zineb Senane, Axel Karlsson, Lele Cao, Oleg Smirnov, Cheng Zhang, Sahar Asadi, Hedvig Kjellstr\"om, Gustav Eje Henter, Ruibo Tu
CATune is a Bayesian optimization framework that incorporates deterministic inter‑knob ordering constraints from DBMS documentation into the search space. By performing optimization within a constraint‑consistent subspace and using a topology‑aware sampling strategy, it avoids costly post‑hoc constraint handling. Experiments on PostgreSQL and MySQL with TPC‑C and TPC‑H workloads show that CATune achieves up to 12.5× faster convergence to the baseline optimum and improves throughput by up to 63.37%.
By Fangping Lan, Qi Zhang, Eduard Dragut
RECAST is a new framework that generates datasets with far more constraints per example than existing benchmarks, aiming to push large language models (LLMs) to better follow complex instructions. The authors built RECAST-30K, a 30,000‑instance dataset covering 19 constraint types extracted from real prompt‑response pairs, and showed that fine‑tuning on it improves LLMs’ ability to handle complex tasks without harming general performance. RECAST also provides rule‑based and LLM‑based validators for automatic constraint verification, enabling reward‑based reinforcement learning to further enhance model performance on challenging tasks.
By Zhengkang Guo, Wenhao Liu, Mingchen Xie, Jingwen Xu, Zisu Huang, Muzhao Tian, Jianhan Xu, Yuanzhe Shen, Qi Qian, Muling Wu, Xiaohua Wang, Changze Lv, He-Da Wang, Hu Yao, Xiaoqing Zheng, Xuanjing Huang
arXiv:2606. 04816v1 Announce Type: new Abstract: Large language models (LLMs) increasingly translate natural-language optimization problems into executable solver code.
By Xizi Luo, Changhong He, Dongdong Geng, Chenggong Shi, Yu Mei
arXiv:2606. 01890v1 Announce Type: new Abstract: Real-world domains often contain heterogeneous tables whose headers vary while their underlying attribute semantics are shared, making it difficult to induce domain-specialized semantics from table-local evidence alone.
By Woojun Jung, Susik Yoon
arXiv:2608. 16050v1 Announce Type: cross Abstract: Spreadsheets are a primary medium for publishing tabular data, yet automatically extracting structured content from them remains difficult due to heterogeneous layouts, diverse file formats, and inconsistent organizational conventions.
By Antoine Gauquier, Ioana Manolescu, Pierre Senellart
arXiv:2609.16069v1 Announce Type: cross
Abstract: Synthetic tabular data can match real data distributions while still violating the semantic constraints that govern valid tabular rows. This reveals...
By Yili Wang, Ruxue Shi, Mengnan Du, Hangting Ye, Yi Chang, Xin Wang
MPMMine introduces a comprehensive benchmark suite for Constraint Acquisition (CA) in Mathematical Programming, addressing shortcomings of existing datasets such as inconsistent formats and limited problem classes. The suite offers standardized, extensible artifacts—including multiple model formulations, numerous parameter instantiations, and thousands of solutions and non‑solutions across discrete, continuous, and mixed domains—alongside natural‑language descriptions for text‑to‑model methods. Accompanying tools, the mpmmine‑py API and an interactive leaderboard, enable consistent evaluation of CA algorithms within isolated containers.
By Rafa{\l} Stachowiak, Tomasz P. Pawlak
arXiv:2509. 09960v2 Announce Type: replace-cross Abstract: Synthetic tabular data generation is increasingly essential in machine learning, supporting downstream applications when real-world, high-quality tabular data is insufficient.
By Mingxuan Jiang, Keyang Chen, Yongxin Wang, Yongsheng Zhao, Ziyue Dai, Yicun Liu, Zeping Li, Qiuyang Zhang, Hongyi Nie, Hongbin Zhu, Sen Liu, Guangnan Ye, Hongfeng Chai