Grables: Tabular Learning Beyond Independent Rows

• URL: http://arxiv.org/abs/2602.03945v1
• Date: Tue, 03 Feb 2026 19:05:21 GMT
• Title: Grables: Tabular Learning Beyond Independent Rows
• Abstract summary: We show that row-wise prediction rules out natural targets driven by global counts, overlaps, and relational patterns.<n>To make "using structure" precise across architectures, we introduce grables, a modular interface that separates how a table is lifted to a graph.
• Score: 5.965765632793876
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Tabular learning is still dominated by row-wise predictors that score each row independently, which fits i.i.d. benchmarks but fails on transactional, temporal, and relational tables where labels depend on other rows. We show that row-wise prediction rules out natural targets driven by global counts, overlaps, and relational patterns. To make "using structure" precise across architectures, we introduce grables: a modular interface that separates how a table is lifted to a graph (constructor) from how predictions are computed on that graph (node predictor), pinpointing where expressive power comes from. Experiments on synthetic tasks, transaction data, and a RelBench clinical-trials dataset confirm the predicted separations: message passing captures inter-row dependencies that row-local models miss, and hybrid approaches that explicitly extract inter-row structure and feed it to strong tabular learners yield consistent gains.

Related papers

• SOMTab: Set-Order Mamba for Efficient Tabular In-Context Learning [30.163512246197843]
  We introduce SOMTab, a Set-Order Mamba architecture for efficient in-context learning.<n>For row and column representations, it maps unordered table tokens into stable latent slots and applies Mamba-based state-space mixing.<n>For final prediction, it retains attention-based in-context learning to preserve query-conditioned retrieval from labeled context examples.
  arXiv  Detail & Related papers  (2026-08-28T03:43:08Z)
• Generating Logically Consistent Synthetic Supply Chain Data with LLM-Driven Knowledge Graph Reasoning [51.78065387034195]
  This paper introduces textbftextitTabKG, a knowledge-graph-guided framework for logically consistent synthetic supply chain data generation.
  arXiv  Detail & Related papers  (2026-05-26T10:41:37Z)
• Learning Causal Orderings for In-Context Tabular Prediction [37.169402067005144]
  In this paper, we study how to infer and enforce causal structure in the form of topological variable orderings.<n>Our model TabOrder uses causal order-constrained attention, basing predictions only on features that precede a target under a learned causal order.<n>Similar to causal discovery methods, TabOrder learns the optimal variable ordering in an unsupervised manner through a likelihood-based objective.
  arXiv  Detail & Related papers  (2026-05-21T11:22:56Z)
• RDBLearn: Simple In-Context Prediction Over Relational Databases [21.996337463952255]
  We show that a simple recipe can be extended to relational prediction with a simple recipe.<n>We package this approach in textitRDBLearn, an easy-to-use toolkit with a scikit-learn-style estimator interface.<n>Across a broad collection of RelBench and 4DBInfer datasets, RDBLearn is the best-performing foundation model approach we evaluate.
  arXiv  Detail & Related papers  (2026-02-14T09:24:04Z)
• Joint Relational Database Generation via Graph-Conditional Diffusion Models [44.06390394789874]
  Building generative models for databases (RDBs) is important for applications like privacy's data release and real datasets.<n>Most prior either focuses on single-table generation or relies on autoregressive factorizations that impose a fixed table order and generate tables sequentially.<n>We propose a fundamentally different approach: jointly modeling all tables in an RDB without imposing any order.
  arXiv  Detail & Related papers  (2025-05-22T11:12:56Z)
• Make Still Further Progress: Chain of Thoughts for Tabular Data Leaderboard [27.224577475861214]
  Tabular data, a fundamental data format in machine learning, is predominantly utilized in competitions and real-world applications.<n>We propose an in-context ensemble framework for tabular prediction that leverages large language models.<n>Our method constructs a context around each test instance using its nearest neighbors and the predictions from a pool of external models.
  arXiv  Detail & Related papers  (2025-05-19T17:52:58Z)
• 4DBInfer: A 4D Benchmarking Toolbox for Graph-Centric Predictive Modeling on Relational DBs [67.47600679176963]
  RDBs store vast amounts of rich, informative data spread across interconnected tables. The progress of predictive machine learning models falls behind advances in other domains such as computer vision or natural language processing. We explore a class of baseline models predicated on converting multi-table datasets into graphs. We assemble a diverse collection of large-scale RDB datasets and (ii) coincident predictive tasks.
  arXiv  Detail & Related papers  (2024-04-28T15:04:54Z)
• Rethinking Pre-Training in Tabular Data: A Neighborhood Embedding Perspective [71.45945607871715]
  We propose Tabular data Pre-Training via Meta-representation (TabPTM)<n>The core idea is to embed data instances into a shared feature space, where each instance is represented by its distance to a fixed number of nearest neighbors and their labels.<n>Extensive experiments on 101 datasets confirm TabPTM's effectiveness in both classification and regression tasks, with and without fine-tuning.
  arXiv  Detail & Related papers  (2023-10-31T18:03:54Z)
• MediTab: Scaling Medical Tabular Data Predictors via Data Consolidation, Enrichment, and Refinement [44.693325083735424]
  Tabular data prediction has been employed in medical applications such as patient health risk prediction. Previous predictors are often trained on manually curated small datasets.
  arXiv  Detail & Related papers  (2023-05-20T03:37:09Z)
• SEMv2: Table Separation Line Detection Based on Instance Segmentation [96.36188168694781]
  We propose an accurate table structure recognizer, termed SEMv2 (SEM: Split, Embed and Merge) We address the table separation line instance-level discrimination problem and introduce a table separation line detection strategy based on conditional convolution. To comprehensively evaluate the SEMv2, we also present a more challenging dataset for table structure recognition, dubbed iFLYTAB.
  arXiv  Detail & Related papers  (2023-03-08T05:15:01Z)
• TRUST: An Accurate and End-to-End Table structure Recognizer Using Splitting-based Transformers [56.56591337457137]
  We propose an accurate and end-to-end transformer-based table structure recognition method, referred to as TRUST. Transformers are suitable for table structure recognition because of their global computations, perfect memory, and parallel computation. We conduct experiments on several popular benchmarks including PubTabNet and SynthTable, our method achieves new state-of-the-art results.
  arXiv  Detail & Related papers  (2022-08-31T08:33:36Z)
• TGRNet: A Table Graph Reconstruction Network for Table Structure Recognition [76.06530816349763]
  We propose an end-to-end trainable table graph reconstruction network (TGRNet) for table structure recognition. Specifically, the proposed method has two main branches, a cell detection branch and a cell logical location branch, to jointly predict the spatial location and the logical location of different cells.
  arXiv  Detail & Related papers  (2021-06-20T01:57:05Z)
• TABBIE: Pretrained Representations of Tabular Data [22.444607481407633]
  We devise a simple pretraining objective that learns exclusively from tabular data. Unlike competing approaches, our model (TABBIE) provides embeddings of all table substructures. A qualitative analysis of our model's learned cell, column, and row representations shows that it understands complex table semantics and numerical trends.
  arXiv  Detail & Related papers  (2021-05-06T11:15:16Z)
• Retrieving Complex Tables with Multi-Granular Graph Representation Learning [20.72341939868327]
  The task of natural language table retrieval seeks to retrieve semantically relevant tables based on natural language queries. Existing learning systems treat tables as plain text based on the assumption that tables are structured as dataframes. We propose Graph-based Table Retrieval (GTR), a generalizable NLTR framework with multi-granular graph representation learning.
  arXiv  Detail & Related papers  (2021-05-04T20:19:03Z)
• GraPPa: Grammar-Augmented Pre-Training for Table Semantic Parsing [117.98107557103877]
  We present GraPPa, an effective pre-training approach for table semantic parsing. We construct synthetic question-pairs over high-free tables via a synchronous context-free grammar. To maintain the model's ability to represent real-world data, we also include masked language modeling.
  arXiv  Detail & Related papers  (2020-09-29T08:17:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.