A Survey on Tabular Data: From Tree-based Methods to Tabular Deep Learning
At a glance
- الاستشهادات
- 4
- المراجع
- 16
- Comments
- 0
Abstract
Tabular data remains one of the most challenging modalities for deep learning due to its heterogeneity, lack of spatial or sequential inductive bias, and small-sample regimes. Key complexities include mixed feature types, high-cardinality categoricals, missing or sparse entries, and weak or irregular feature interactions-conditions that make representation learning and generalization difficult for neural networks. While early neural approaches struggled to match tree-based methods, recent advances demonstrate measurable progress across representation learning, regularization, and architectural design. This survey synthesizes findings from more than a decade of research, highlighting tabular data across two major families of approaches: classical models centered on decision trees and ensembles, and deep learning architectures. We identify three major trends: (1) the shift toward attention-based and hybrid architectures capable of modeling non-local interactions; (2) growing use of pretraining, self-supervision, and foundation-model-style priors to mitigate overfitting; and (3) emerging diffusion, graph-based, and multimodal frameworks that improve robustness and generalization. Despite these advances, tree-based methods remain strong baselines in low-dimensional and small-data contexts. By distilling empirical patterns across benchmarks and applications, this survey clarifies when deep learning delivers real gains for tabular data. We close with a prioritized research agenda on scalability, interpretability, and unified modeling.
Publication details
- DOI
- 10.1145/3807777
- OpenAlex
- W7151926895
- Document type
- article
- Language
- EN
- Source
- ACM Computing Surveys
- Last metadata update
Comments
تسجيل الدخول للانضمام إلى النقاش.