🤖 AI Summary
In quantitative structure–activity relationship (QSAR) modeling, activity cliffs—molecular pairs with high structural similarity but large bioactivity differences—pose a fundamental challenge for conventional machine learning and graph neural networks (GNNs), which often lack sufficient discriminative power. To address this, we propose Short-Long-range Gated Graph Neural Network (SL-GNN), a novel architecture that jointly models short-range local atomic interactions and long-range topological dependencies via a gating mechanism, thereby mitigating GNN over-smoothing and enhancing sensitivity to subtle structural variations. Hierarchical node embedding analysis validates improved representation quality. On multiple QSAR benchmark datasets, SL-GNN achieves statistically significant performance gains over state-of-the-art GNNs—both on activity cliff instances and general compounds—demonstrating superior discriminability without compromising generalization. This work establishes a new paradigm for molecular representation learning tailored to fine-grained bioactivity differentiation.
📝 Abstract
Quantitative structure-activity relationship assumes a smooth relationship between molecular structure and biological activity. However, activity cliffs defined as pairs of structurally similar compounds with large potency differences break this continuity. Recent benchmarks targeting activity cliffs have revealed that classical machine learning models with extended connectivity fingerprints outperform graph neural networks. Our analysis shows that graph embeddings fail to adequately separate structurally similar molecules in the embedding space, making it difficult to distinguish between structurally similar but functionally different molecules. Despite this limitation, molecular graph structures are inherently expressive and attractive, as they preserve molecular topology. To preserve the structural representation of molecules as graphs, we propose a new model, GraphCliff, which integrates short- and long-range information through a gating mechanism. Experimental results demonstrate that GraphCliff consistently improves performance on both non-cliff and cliff compounds. Furthermore, layer-wise node embedding analyses reveal reduced over-smoothing and enhanced discriminative power relative to strong baseline graph models.