arXiv Machine Learning August 27, 2026 By Fahim Shahriar Khan, Ashraf Aboulnaga

MetaSieve: Faster Relational Deep Learning through SQL-Based Metapath Selection

Read the original on arXiv Machine Learning →

MetaSieve is a metapath selection layer that reduces subgraph size in relational deep learning by pruning uninformative metapaths using SQL join and aggregation statistics. It scores candidate metapath extensions with a lightweight function that favors informative yet lightweight paths, discarding those below a threshold. The method is independent of GNN parameters and, when applied to the RelBench benchmark, consistently cuts per‑epoch training time while preserving or improving accuracy.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI

Jun 9

What Makes a Desired Graph for Relational Deep Learning?

arXiv:2606. 08491v1 Announce Type: new Abstract: Relational deep learning (RDL) converts relational databases (RDBs) into heterogeneous graphs, but graphs derived directly from database schemas are often not well suited for how graph neural networks (GNNs) perform relational reasoning.

By Yao Cheng, Siqiang Luo

safety

arXiv AI

Jul 7

A Fair Benchmarking of Deep Relational Database Learning Models

arXiv:2607. 03659v1 Announce Type: cross Abstract: Relational databases (RDBs) are the primary data infrastructure in many enterprises, yet recent deep learning methods designed for RDBs have been evaluated under inconsistent experimental protocols, making fair comparison difficult.

By Kazi F. Akhter, Bharath Ajendla, Manar D. Samad

llms benchmarks

arXiv AI

Jun 3

RelGT-AC: A Relational Graph Transformer for Autocomplete Tasks in Relational Databases

arXiv:2606. 03040v1 Announce Type: new Abstract: Relational databases underpin modern enterprise, scientific, and healthcare systems, yet predictive machine learning on such data remains challenging due to their multi-table, heterogeneous, and temporal structure.

By Phillip Jiang

llms

arXiv Machine Learning

Aug 14

Incremental Evaluation and Training in Relational Deep Learning

arXiv:2608. 13023v1 Announce Type: new Abstract: Relational Deep Learning (RDL) models multi-tabular databases as temporal heterogeneous graphs to enable end-to-end representation learning.

By Jakub Pele\v{s}ka, Gustav \v{S}\'ir

fine-tuning benchmarks

arXiv Machine Learning

Jun 5

The Post-GCN Decade Revisited: Curvature-Stratified Evaluation of Relational Learning

arXiv:2606. 06397v1 Announce Type: new Abstract: Current evaluation practices in relational learning rely heavily on flat leaderboards that average performance across heterogeneous datasets, implicitly assuming a uniform underlying structure.

By Shuo Wang, Xiangyu Wang, Quanxin Wang, Bailin Wu, Bokui Wang, Shunyang Huang, Boyan Deng, Haonan Liu, Ruiyi Fang, Zhenxiang Xu, Boyu Wang, Zhao Kang

benchmarks safety

arXiv Machine Learning

Aug 18

Not All Neighbors Matter: Understanding the Impact of Graph Sparsification on GNN Pipelines

arXiv:2603. 06952v2 Announce Type: replace Abstract: As graphs scale to billions of nodes and edges, graph Machine Learning workloads are constrained by the cost of multi-hop traversals over exponentially growing neighborhoods.

By Yuhang Song, Naima Abrar Shami, Romaric Duvignau, Vasiliki Kalavri

One email a morning, machine-written

Related stories

What Makes a Desired Graph for Relational Deep Learning?

A Fair Benchmarking of Deep Relational Database Learning Models

RelGT-AC: A Relational Graph Transformer for Autocomplete Tasks in Relational Databases

Incremental Evaluation and Training in Relational Deep Learning

The Post-GCN Decade Revisited: Curvature-Stratified Evaluation of Relational Learning

Not All Neighbors Matter: Understanding the Impact of Graph Sparsification on GNN Pipelines