arXiv Analytics

Sign in

arXiv:2205.07023 [cs.LG]AbstractReferencesReviewsResources

High Performance of Gradient Boosting in Binding Affinity Prediction

Dmitrii Gavrilev, Nurlybek Amangeldiuly, Sergei Ivanov, Evgeny Burnaev

Published 2022-05-14Version 1

Prediction of protein-ligand (PL) binding affinity remains the key to drug discovery. Popular approaches in recent years involve graph neural networks (GNNs), which are used to learn the topology and geometry of PL complexes. However, GNNs are computationally heavy and have poor scalability to graph sizes. On the other hand, traditional machine learning (ML) approaches, such as gradient-boosted decision trees (GBDTs), are lightweight yet extremely efficient for tabular data. We propose to use PL interaction features along with PL graph-level features in GBDT. We show that this combination outperforms the existing solutions.

Related articles: Most relevant | Search more
arXiv:1912.07721 [cs.LG] (Published 2019-12-16)
Adversarial Model Extraction on Graph Neural Networks
arXiv:2004.09808 [cs.LG] (Published 2020-04-21)
Perturb More, Trap More: Understanding Behaviors of Graph Neural Networks
arXiv:2004.04546 [cs.LG] (Published 2020-04-09)
Recognizing Spatial Configurations of Objects with Graph Neural Networks