Co-occurring keywords · papers mentioning both
Papers
Association Pattern-enhanced Molecular Representation Learning
AAAI 2025
Best of Both Worlds: Advantages of Hybrid Graph Sequence Models
ICML 2025
Coupling Category Alignment for Graph Domain Adaptation
IJCAI 2025
Faithful and Accurate Self-Attention Attribution for Message Passing Neural Networks via the Computation Tree Viewpoint
AAAI 2025
Griffin: Towards a Graph-Centric Relational Database Foundation Model
ICML 2025
Homomorphism Counts as Structural Encodings for Graph Learning
ICLR 2025
Improving the Effective Receptive Field of Message-Passing Neural Networks
ICML 2025
On the Expressive Power of Sparse Geometric MPNNs
ICLR 2025
On the Hölder Stability of Multiset and Graph Neural Networks
ICLR 2025
Revisiting Random Walks for Learning on Graphs
ICLR 2025
Towards a Complete Logical Framework for GNN Expressiveness
ICLR 2025
Transformers from Diffusion: A Unified Framework for Neural Message Passing
JMLR 2025
Uncertainty Estimation for Heterophilic Graphs Through the Lens of Information Theory
ICML 2025
Understanding Virtual Nodes: Oversquashing and Node Heterogeneity
ICLR 2025
What Can We Learn From MIMO Graph Convolutions?
IJCAI 2025
WILTing Trees: Interpreting the Distance Between MPNN Embeddings
ICML 2025
Equivariant Matrix Function Neural Networks
ICLR 2024
Learning-Based Spotlight Position Optimization for Non-Line-of-Sight Human Localization and Posture Classification
WACV 2024
Learning on Large Graphs using Intersecting Communities
NeurIPS 2024
Neural Common Neighbor with Completion for Link Prediction
ICLR 2024
Probabilistically Rewired Message-Passing Neural Networks
ICLR 2024
Pure Message Passing Can Estimate Common Neighbor for Link Prediction
NeurIPS 2024
Scene Graph Generation Strategy with Co-occurrence Knowledge and Learnable Term Frequency
ICML 2024
Theory-guided Message Passing Neural Network for Probabilistic Inference
AISTATS 2024
Verifying message-passing neural networks via topology-based bounds tightening
ICML 2024