aiqbench analysis
This paper introduces Grables, a modular framework that rigorously separates table-to-graph construction from node-level prediction to clarify when graph structures are necessary for tabular data tasks. By establishing a theoretical hierarchy between row-local models and relational aggregations, the authors demonstrate that standard benchmarks often fail to detect structural dependencies, necessitating stress tests to validate true cross-row reasoning capabilities. The work provides a practical recipe for incrementally adding structural complexity only where targets are extension-sensitive, offering clarity on the expressive power limits of various tabular architectures.
Grables: When Graph Structure Helps Tabular Prediction
arXiv:2602.03945v2 Announce Type: replace Abstract: Simple row-wise predictors that score each row independently remain competitive with far more expressive architectures on tabular benchmarks, which are i.i.d. by construction. They cannot, however, represent natural targets on transactional, temporal, and relational tables, where labels depend on other rows. We show that row-wise prediction provably rules out 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), placing gradient-boosted trees, neighbourhood aggregation, transformer-style tabular models, and relational GNNs on a single axis and pinpointing where expressive power comes from. The framework yields a hierarchy that answers when structure is needed: row-local models suffice for extension-invariant targets, lightweight neighbourhood aggregation captures shallow inter-row signals, and explicit graph construction is needed for compositional patterns that fixed aggregations cannot express without exponential feature blow-up. Experiments on synthetic, transactional, and relational data confirm the predicted separations, but also show that benchmark performance is a poor proxy for structural capability: row-local models score well on tasks they provably cannot represent, and a stress-test that suppresses row-local cues is needed to expose the gap. Conversely, access to cross-row context does not imply a model uses it. Feeding explicitly extracted inter-row structure to strong tabular learners yields gains exactly where the hierarchy predicts. The practical recipe is to add structure incrementally, and only where the target is extension-sensitive.
Abstract:Simple row-wise predictors that score each row independently remain competitive with far more expressive architectures on tabular benchmarks, which are i.i.d. by construction. They cannot, however, represent natural targets on transactional, temporal, and relational tables, where labels depend on other rows. We show that row-wise prediction provably rules out 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), placing gradient-boosted trees, neighbourhood aggregation, transformer-style tabular models, and relational GNNs on a single axis and pinpointing where expressive power comes from. The framework yields a hierarchy that answers when structure is needed: row-local models suffice for extension-invariant targets, lightweight neighbourhood aggregation captures shallow inter-row signals, and explicit graph construction is needed for compositional patterns that fixed aggregations cannot express without exponential feature blow-up. Experiments on synthetic, transactional, and relational data confirm the predicted separations, but also show that benchmark performance is a poor proxy for structural capability: row-local models score well on tasks they provably cannot represent, and a stress-test that suppresses row-local cues is needed to expose the gap. Conversely, access to cross-row context does not imply a model uses it. Feeding explicitly extracted inter-row structure to strong tabular learners yields gains exactly where the hierarchy predicts. The practical recipe is to add structure incrementally, and only where the target is extension-sensitive.
Machine Learning (cs.LG)
arXiv:2602.03945 [cs.LG]
(or arXiv:2602.03945v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2602.03945 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 338 words
Related coverage

NVIDIA Kumo Tabular Sets a New Accuracy-Efficiency Frontier for Tabular Prediction
Hugging Face · Sep 29, 2026

7 Machine Learning Algorithms That Still Matter
KDnuggets · Jul 30, 2026

Import AI 467: Self-sustaining AI viruses; pacing AI progress; confusion about AI and creativity
Import AI · Aug 3, 2026

Graph-centric agentic intelligence
Amazon Science · Oct 1, 2026