GraphCliff: Short-Long Range Gating for Modeling Critical Activity Changes Caused by Subtle Molecular Differences
Not on the map. Why?
Abstract (arXiv)
The quantitative structure-activity relationship assumes a smooth mapping between molecular structure and biological activity. However, activity cliffs, defined as pairs of structurally similar compounds with large potency differences, break this continuity. Recent activity cliff benchmarks show that machine learning models with extended connectivity fingerprints outperform graph neural networks. Our analysis shows that the embedding distances of conventional graph neural networks fail to reflect the activity differences, collapsing structurally similar yet functionally divergent molecules into nearly indistinguishable representations. To recover sensitivity to such local changes while preserving global molecular context, we propose GraphCliff, which integrates short and long range information at the node level through a locally conditioned gating mechanism. Experimental results demonstrate that GraphCliff consistently improves performance on both non-cliff and cliff compounds, with layer-wise embedding analyses attributing these gains to sharper discrimination of structurally similar molecules relative to strong baseline graph models.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 45 references that are in the map. First posted on arXiv 5 Nov 2025.
Builds on
18 of 45 references.
References · 18
- 2017Attention Is All You Needcited by 59,932
- 2017Graph Attention Networkscited by 8,854
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 987
- 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 875
- 2020Simple and Deep Graph Convolutional Networkscited by 857
- 2015Gated Graph Sequence Neural Networkscited by 792
- 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 544
- 2019Self-Attention Graph Poolingcited by 421
- 2019PairNorm: Tackling Oversmoothing in GNNscited by 297
- 2016Molecular Graph Convolutions: Moving Beyond Fingerprintscited by 238
6 more
- 2018GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphscited by 164
- 2020Understanding and Resolving Performance Degradation in Graph Convolutional Networkscited by 53
- 2025Systems and Algorithms for Convolutional Multi-Hybrid Language Models at Scalecited by 12
- 2025Return of ChebNet: Understanding and Improving an Overlooked GNN on Long Range Taskscited by 12
- 2021Graph Feature Gating Networkscited by 3
- 2020Graph Highway Networkscited by 2
Built on by
Not cited yet.