Expressivity and Generalization: Fragment-Biases for Molecular GNNs
Not on the map. Why?
Abstract (arXiv)
Although recent advances in higher-order Graph Neural Networks (GNNs) improve the theoretical expressiveness and molecular property predictive performance, they often fall short of the empirical performance of models that explicitly use fragment information as inductive bias. However, for these approaches, there exists no theoretic expressivity study. In this work, we propose the Fragment-WL test, an extension to the well-known Weisfeiler & Leman (WL) test, which enables the theoretic analysis of these fragment-biased GNNs. Building on the insights gained from the Fragment-WL test, we develop a new GNN architecture and a fragmentation with infinite vocabulary that significantly boosts expressiveness. We show the effectiveness of our model on synthetic and real-world data where we outperform all GNNs on Peptides and have 12% lower error than all GNNs on ZINC and 34% lower error than other fragment-biased models. Furthermore, we show that our model exhibits superior generalization capabilities compared to the latest transformer-based architectures, positioning it as a robust solution for a range of molecular modeling tasks.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 32 of its 48 references that are in the map. First posted on arXiv 12 Jun 2024.
Builds on
32 of 48 references.
References · 32
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,037
- 2016Automatic chemical design using a data-driven continuous representation of moleculescited by 762
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 702
- 2018Junction Tree Variational Autoencoder for Molecular Graph Generationcited by 647
- 2020Directional Message Passing for Molecular Graphscited by 556
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 471
- 2021Rethinking Graph Transformers with Spectral Attentioncited by 468
- 2019Provably Powerful Graph Networkscited by 385
- 2017Residual Gated Graph ConvNetscited by 341
20 more
- 2021Do Transformers Really Perform Bad for Graph Representation?cited by 318
- 2020Improving Graph Neural Network Expressivity via Subgraph Isomorphism Countingcited by 312
- 2020Can Graph Neural Networks Count Substructures?cited by 235
- 2020Hierarchical Generation of Molecular Graphs using Structural Motifscited by 204
- 2019On the equivalence between graph isomorphism testing and function approximation with GNNscited by 172
- 2021Motif-based Graph Self-Supervised Learning for Molecular Property Predictioncited by 159
- 2022A Generalization of ViT/MLP-Mixer to Graphscited by 93
- 2021Learning to Extend Molecular Scaffolds with Structural Motifscited by 70
- 2022MolGenSurvey: A Systematic Survey in Machine Learning Models for Molecule Designcited by 66
- 2020Hierarchical Inter-Message Passing for Learning on Molecular Graphscited by 59
- 2022Boosting the Cycle Counting Power of Graph Neural Networks with I2-GNNscited by 55
- 2022A Short Tutorial on The Weisfeiler-Lehman Test And Its Variantscited by 52
- 2023De Novo Molecular Generation via Connection-aware Motif Miningcited by 45
- 2021Autobahn: Automorphism-based Graph Neural Netscited by 39
- 2023The Expressive Power of Graph Neural Networks: A Surveycited by 27
- 2023Motif-aware Attribute Masking for Molecular Graph Pre-trainingcited by 16
- 2023Deep Learning Methods for Small Molecule Drug Discovery: A Surveycited by 10
- 2023MAGNet: Motif-Agnostic Generation of Molecules from Shapescited by 7
- 2023The power of motifs as inductive bias for learning molecular distributionscited by 6
- 2019The Power of the Weisfeiler-Leman Algorithm to Decompose Graphscited by 4
Built on by
Citing papers per year: 2025: 4; 2026: 4.
8 papers.
- 2025Graph-structured Small Molecule Drug Discovery Through Deep Learning: Progress, Challenges, and Opportunitiescited by 5
- 2025What Expressivity Theory Misses: Message Passing Complexity for GNNscited by 1
- 2026XIMP: Cross Graph Inter-Message Passing for Molecular Property Predictioncited by 1
- 2026Hierarchical Molecular Representation Learning via Fragment-Based Self-Supervised Embedding Predictioncited by 1
- 2025MIPS: a Multimodal Infinite Polymer Sequence Pre-training Framework for Polymer Property Predictioncited by 0
- 2025Learning the Neighborhood: Contrast-Free Multimodal Self-Supervised Molecular Graph Pretrainingcited by 0
- 2026Multi-scale Graph Autoregressive Modeling: Molecular Property Prediction via Next Token Predictioncited by 0
- 2026The Role of Node Features in Graph Poolingcited by 0
- 2026The Role of Node Features in Graph Pooling7 May 2026
- 2026Hierarchical Molecular Representation Learning via Fragment-Based Self-Supervised Embedding Prediction23 Feb 2026
- 2026XIMP: Cross Graph Inter-Message Passing for Molecular Property Prediction26 Jan 2026
- 2026Multi-scale Graph Autoregressive Modeling: Molecular Property Prediction via Next Token Prediction5 Jan 2026
- 2025Learning the Neighborhood: Contrast-Free Multimodal Self-Supervised Molecular Graph Pretraining26 Sep 2025
- 2025What Expressivity Theory Misses: Message Passing Complexity for GNNs1 Sep 2025
- 2025MIPS: a Multimodal Infinite Polymer Sequence Pre-training Framework for Polymer Property Prediction27 Jul 2025
- 2025Graph-structured Small Molecule Drug Discovery Through Deep Learning: Progress, Challenges, and Opportunities13 Feb 2025