FROG makes full-resolution graph structure learnable in relational deep learning by modeling table roles as optimizable components in message passing, regularized by functional dependency constraints.
NeurIPS , volume=
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 3years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
AHGCDD distills large hypergraphs into informative synthetic versions via anchor-guided joint optimization and dual-level discrimination, achieving better effectiveness and efficiency than prior decoupled HGC approaches.
QpiGNN provides a quantile-free dual-head architecture for GNN uncertainty quantification that directly optimizes coverage and interval width, yielding 22% higher coverage and 50% narrower intervals than baselines on 19 benchmarks with asymptotic coverage guarantees under mild assumptions.
citing papers explorer
-
Is Fixing Schema Graphs Necessary? Full-Resolution Graph Structure Learning for Relational Deep Learning
FROG makes full-resolution graph structure learnable in relational deep learning by modeling table roles as optimizable components in message passing, regularized by functional dependency constraints.
-
Anchor-guided Hypergraph Condensation with Dual-level Discrimination
AHGCDD distills large hypergraphs into informative synthetic versions via anchor-guided joint optimization and dual-level discrimination, achieving better effectiveness and efficiency than prior decoupled HGC approaches.
-
Quantile-Free Uncertainty Quantification in Graph Neural Networks
QpiGNN provides a quantile-free dual-head architecture for GNN uncertainty quantification that directly optimizes coverage and interval width, yielding 22% higher coverage and 50% narrower intervals than baselines on 19 benchmarks with asymptotic coverage guarantees under mild assumptions.