Rethinking the generalization of drug target affinity prediction algorithms via similarity aware evaluation
Chenbin Zhang, Zhiqiang Hu, Chuchu Jiang, Wen Chen, Jie Xu, Shaoting Zhang
TL;DR
The paper addresses the problem that standard randomized test splits in drug-target affinity prediction overstate generalization by overrepresenting high-similarity samples. It introduces Similarity Aware Evaluation (SAE), a differentiable framework that relaxes the test/train partition into a weighted split and optimizes a chi-square-like objective to achieve a user-specified similarity distribution across test samples, using LogSumExp proxies and softbinning with entropy regularization. SAE is demonstrated across four distributions (including balanced and mimic splits) and five representative DTA methods on multiple datasets, revealing that model performance correlates with similarity and that mimic splits can guide hyperparameter selection to align internal validation with external performance. The framework offers a flexible, scalable approach to generate meaningful test distributions for robust model development and has potential applications in QSAR, PPI, and DDI prediction, with code available at the provided repository.
Abstract
Drug-target binding affinity prediction is a fundamental task for drug discovery. It has been extensively explored in literature and promising results are reported. However, in this paper, we demonstrate that the results may be misleading and cannot be well generalized to real practice. The core observation is that the canonical randomized split of a test set in conventional evaluation leaves the test set dominated by samples with high similarity to the training set. The performance of models is severely degraded on samples with lower similarity to the training set but the drawback is highly overlooked in current evaluation. As a result, the performance can hardly be trusted when the model meets low-similarity samples in real practice. To address this problem, we propose a framework of similarity aware evaluation in which a novel split methodology is proposed to adapt to any desired distribution. This is achieved by a formulation of optimization problems which are approximately and efficiently solved by gradient descent. We perform extensive experiments across five representative methods in four datasets for two typical target evaluations and compare them with various counterpart methods. Results demonstrate that the proposed split methodology can significantly better fit desired distributions and guide the development of models. Code is released at https://github.com/Amshoreline/SAE/tree/main.
