用预训练表结构模型提升关系型数据的推理效率与精度
Boosting Relational Deep Learning with Pretrained Tabular Models
- 结合图神经网络与手工特征,分治处理复杂关系与时间信息
- 在RelBench上实现33%性能提升和526倍推理加速
- 适合需要实时响应的关系数据预测场景
关系型数据库以表格形式组织,通过主外键连接。传统方法需通过表连接和特征工程将数据转为扁平格式输入模型,但难以充分捕捉复杂关系。图神经网络(GNN)能天然建模关系,但推理开销大,不适合实时应用。本文提出LightRDL方法:利用GNN捕获难以人工设计的关系模式,同时用预处理特征编码时间信息,避免存储完整历史图,从而使用更小、更高效的图结构。在RelBench基准测试中,该方法相较GNN实现最高33%性能提升和526倍推理加速,显著提升效率与适用性。
原文摘要 · Abstract (English)
Relational databases, organized into tables connected by primary-foreign key relationships, are a common format for organizing data. Making predictions on relational data often involves transforming them into a flat tabular format through table joins and feature engineering, which serve as input to tabular methods. However, designing features that fully capture complex relational patterns remains challenging. Graph Neural Networks (GNNs) offer a compelling alternative by inherently modeling these relationships, but their time overhead during inference limits their applicability for real-time scenarios. In this work, we aim to bridge this gap by leveraging existing feature engineering efforts to enhance the efficiency of GNNs in relational databases. Specifically, we use GNNs to capture complex relationships within relational databases, patterns that are difficult to featurize, while employing engineered features to encode temporal information, thereby avoiding the need to retain the entire historical graph and enabling the use of smaller, more efficient graphs. Our \textsc{LightRDL} approach not only improves efficiency, but also outperforms existing models. Experimental results on the RelBench benchmark demonstrate that our framework achieves up to $33\%$ performance improvement and a $526\times$ inference speedup compared to GNNs, making it highly suitable for real-time inference.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。