菜单

关于 🐙 GitHub
arXiv 提交日期: 2026-05-20
📄 Abstract - Is Fixing Schema Graphs Necessary? Full-Resolution Graph Structure Learning for Relational Deep Learning

Relational prediction tasks are fundamental in many real-world applications, where data are naturally stored in relational databases (RDBs). Relational Deep Learning (RDL) addresses this problem by modeling RDBs as graphs and applying graph neural networks (GNNs) for end-to-end learning. However, the full-resolution property is commonly adopted as a design principle in graph construction for RDBs to preserve relational semantics, which leads most existing methods to rely on fixed graph structures. In this paper, we propose FROG, a Full-Resolution and Optimizable Graph Structure Learning} framework for RDL that formulates relational structure learning as a learnable table role modeling problem, allowing tables to contribute as nodes and edges in message passing. We further design role-driven message passing mechanisms to capture relational semantics, enabling joint optimization of graph structure and GNN representations. To ensure semantic consistency, we introduce functional dependency constraints that regularize representations across table and entity levels. Extensive experiments demonstrate that our method outperforms existing approaches and reveal how table roles impact downstream tasks, offering new insights into graph construction for RDL

顶级标签: machine learning systems
详细标签: relational deep learning graph structure learning graph neural networks relational databases message passing 或 搜索:

固定模式图是否必要?面向关系深度学习的全分辨率图结构学习 / Is Fixing Schema Graphs Necessary? Full-Resolution Graph Structure Learning for Relational Deep Learning


1️⃣ 一句话总结

本文提出一种名为FROG的新型框架,首次在关系深度学习中实现可学习的图结构优化,通过动态判定数据库表格在消息传递中扮演节点还是边的角色,从而打破传统方法必须依赖固定模式图的限制,大幅提升了多表关联预测任务的性能。

源自 arXiv: 2605.21475