Statistical Edge Graphs for Tabular Learning with Graph Neural Networks
Tabular data are central to many real-world applications, yet deep learning models often underperform compared to tree-based methods due to limited relational inductive bias. We propose a unified framework that models each tabular instance as an instance-level statistical feature graph to enable learning with Graph Neural Networks (GNNs). In this representation, features are treated as nodes, and edges encode pairwise statistical relationships derived from Z-score similarity, covariance, Pearson correlation, or Euclidean distance. This formulation explicitly captures inter-feature dependencies rather than relying solely on implicitly learned interactions. We evaluate the framework across four classification and four regression datasets spanning diverse domains and feature dimensionalities. Results demonstrate competitive and, in several cases, superior performance compared to strong baselines including Random Forests, XGBoost, and multilayer perceptrons. Correlation- and covariance-based edge constructions consistently provide robust performance across tasks. Furthermore, empirical analysis indicates that performance gains become more pronounced in higher-dimensional datasets, suggesting that graph-based representations are particularly effective at modeling complex feature interactions. Overall, this work provides a systematic examination of statistical graph construction for tabular learning and highlights the potential of GNNs as a structured alternative to conventional tabular models.