SAGE: Sparse Adaptive Guidance for Dependency-Aware Tabular Data Generation (2026.acl-long)
Copied to clipboard
| Challenge: | Recent approaches to generate tabular data are limited by their static dependences and lack of fidelity. |
| Approach: | They propose a novel LLM-based generation framework that enforces sparse and dynamic dependency guidance. |
| Outcome: | The proposed framework boosts F1 scores by 10% and reduces policy violations by one point. |
Similar Papers
Not All Features Deserve Attention: Graph-Guided Dependency Learning for Tabular Data Generation with Language Models (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown strong potential for tabular data generation by modeling textualized feature-value pairs. |
| Approach: | They propose a method that explicitly integrates sparse dependency graphs into LLMs’ attention mechanism. |
| Outcome: | The proposed method outperforms existing LLM-based approaches by up to 12% on complex datasets while achieving competitive results with state-of-the-art approaches in synthetic data quality. |
Doubling Your Data in Minutes: Ultra-fast Tabular Data Generation via LLM-Induced Dependency Graphs (2025.emnlp-main)
Copied to clipboard
| Challenge: | Tabular data is critical across diverse domains, yet high-quality tabular datasets remain scarce due to privacy concerns and the cost of collection. |
| Approach: | They propose a lightweight generative framework that captures sparse dependencies via an LLM-induced graph. |
| Outcome: | The proposed framework reduces constraint violations by 4% and accelerates generation by nearly 9,500 over diffusion-based methods. |
TABGEN-ICL: Residual-Aware In-Context Example Selection for Tabular Data Generation (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to tabular data generation require fine-tuning, which is computationally expensive. |
| Approach: | They propose a new in-context learning framework to prompt a fixed LLM with in-constitut examples to enhance the in-text learning ability of LLMs for tabular data generation. |
| Outcome: | The proposed framework outperforms random selection strategies on five real-world tabular datasets and reduces error rate by 42.2% on fidelity metric. |
TableDreamer: Progressive and Weakness-guided Data Synthesis from Scratch for Table Instruction Tuning (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for table instruction tuning are limited due to limited data diversity and lack of data quality. |
| Approach: | They propose a weakness-guided data synthesis framework for table instruction tuning that explores the vast input space of table understanding tasks and then iterates through the input space. |
| Outcome: | The proposed framework boosts the average accuracy of Llama3.1-8B-instruct by 11.62% with 27K GPT-4o synthetic data and outperforms state-of-the-art data synthesis baselines which use more training data. |
AIGT: AI Generative Table Based on Prompt (2025.coling-main)
Copied to clipboard
| Challenge: | Tabular data is an essential resource for many fields, but current methods do not fully utilize the rich information available in tables. |
| Approach: | They propose a method that utilizes metadata information to generate tabular data . they propose long-token partitioning algorithms that enable AIGT to model tables of any scale . |
| Outcome: | The proposed approach achieves state-of-the-art on 14 out of 20 public datasets and two real industry datasets within the Alipay risk control system. |
Beyond Static Rules: Automated Discovery of Latent Vulnerabilities in Text-to-SQL (2026.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have been successful in Text-to-SQL tasks, but their deployment in real-world environments is hindered by latent reliability issues. |
| Approach: | They propose a framework to autonomously uncover latent failure patterns in LLM-based Text-to-SQL generation. |
| Outcome: | The proposed framework uncovers a substantial number of failure cases on state-of-the-art open-source LLMs. |
Towards Interpretable Tabular Reasoning: Enhancing LLM Reasoning on Tabular Data with Pre-Constructed Logic Graph (2026.acl-long)
Copied to clipboard
Lirong Gao, Zewei Yu, Zhongrui Yin, Qi Zhang, Yuke Zhu, Bo Zheng, Haobo Wang, Junbo Zhao, Gang Chen, Sheng Guo
| Challenge: | Tabular data is used in fields such as finance and healthcare due to its heterogeneity and complexity. |
| Approach: | They propose a Logic-Graph-Enhanced LLM Reasoning framework that integrates the strengths of tree-based models and LLMs to improve their interpretability. |
| Outcome: | The proposed framework outperforms tree-based models and state-of-the-art LLMs on tabular prediction tasks, achieving superior accuracy and interpretability. |
TabReX: Tabular Referenceless eXplainable Evaluation (2026.acl-long)
Copied to clipboard
| Challenge: | Existing metrics for evaluating the quality of tables generated by large language models flatten tables into text, ignoring structure or relying on fixed references that limit generalization. |
| Approach: | They propose a reference-less framework for evaluating tabular generation via graph-based reasoning . tabReX converts source text and generated tables into canonical knowledge graphs . |
| Outcome: | The proposed framework provides a high correlation with expert rankings and stable under harder perturbations. |
LLM-Symbolic Integration for Robust Temporal Tabular Reasoning (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for temporal tabular question answering are inconsistent and fail to provide the variability needed to thoroughly evaluate models. |
| Approach: | TEMPTABQA-C uses a synthetic dataset and symbolic representation to generate and execute SQL queries. |
| Outcome: | TEMPTABQA-C improves on previous methods for temporal tabular question answering . incorporating adaptive fewshot prompting with tailored examples improves performance . lack of robustness, scalability, and interpretable solutions is key obstacle . |
An Efficient Retrieval-Based Method for Tabular Prediction with LLM (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods for tabular prediction rely on extensive pre-training or fine-tuning of LLMs . a retrieval-based approach eliminates the need for training any modules or performing data augmentation . |
| Approach: | They propose a retrieval-based approach that utilizes the powerful capabilities of large language models in representation, comprehension, and inference. |
| Outcome: | The proposed method exhibits strong predictive performance on tabular prediction task, affirming its practicality and effectiveness. |