Schema-derived graphs for relational deep learning suffer from information overload and semantic fragmentation; controlled filtering and injection via an end-to-end optimizer improves accuracy on 26 tasks while often lowering inference cost.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
What Makes a Desired Graph for Relational Deep Learning?
Schema-derived graphs for relational deep learning suffer from information overload and semantic fragmentation; controlled filtering and injection via an end-to-end optimizer improves accuracy on 26 tasks while often lowering inference cost.