- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes PAFDTA, a multi-source representation learning framework for drug–target affinity prediction. It combines drug graphs, protein sequences, and drug–target relationships using contrastive alignment and adaptive fusion. The authors evaluate the framework on the Davis and KIBA benchmark datasets and conduct ablation studies and case studies. The results show that the framework achieves competitive performance in affinity prediction. However, its main methodological contribution appears to be the integration and adaptation of existing representation learning, contrastive learning, and fusion techniques. Overall, the paper presents a comprehensive DTA framework, but the novelty and specific contributions of its components need to be better demonstrated.
Critical strengths
The paper integrates molecular graph features, pretrained protein representations, drug-target pair context, and relational topology to capture complementary information for affinity prediction.
Critical weaknesses
1.The research motivation is unclear, as it does not specify what concrete limitation of existing DTA methods PAFDTA addresses. 2. No code is released, making key implementation details difficult to verify. 3. The methodological novelty is limited, since the framework mainly combines existing techniques such as GIN, ESM2, Transformer pooling, Affinity2Vec meta-paths, and gated fusion, without clearly articulating the core novel contribution. 4. PAFDTA does not outperform baselines on most metrics. 5. The paper does not clarify whether the experimental settings and data splits are consistent with those of the baselines. 6. The task is conventional and the metrics are standard, so the empirical contribution may need stronger justification.
Questions for authors
- The results for the comparison methods in Table 1 are all taken from their respective published papers. The authors are requested to clarify whether these methods employed the same machine training and data partitioning as PAFDTA.
- For proteins longer than 1,024 residues, how are the residue embeddings truncated or selected for the downstream model after ESM2 feature extraction?
- Why do removing the topological prior and CBCA improve CI over the full model, and how do the authors justify the contributions of these components? 4.What value of the temperature parameter τ is used in Eq. (5)?
- It remains unclear whether the performance gains stem from the fusion strategy itself or simply from the additional input information.
- The data partitioning might be flawed, the training and test sets could contain the same proteins or small molecules.
- The task addressed in this paper is relatively conventional within the DTA field. The evaluation metrics adopted are fairly standard and straightforward.
- In the KIBA double-cold setting, PAFDTA achieves a higher CI than LLMDTA, but its MSE and R² are substantially worse. How do the authors reconcile this with their claims about generalization to unseen drugs and targets?
4 comments
Follow-up Comments to the Authors
Thank you for the detailed rebuttal. These responses address several of my technical questions. However, some of my main concerns remain unresolved.
Q1. Were the baselines trained using the same machine and data partitioning as PAFDTA?
The authors confirm that the baseline results in Table 1 were taken from different publications rather than reproduced under a unified experimental protocol. While this clarification is helpful, it also confirms that the reported comparisons may be affected by differences in data partitioning, preprocessing, and training configurations. Could the authors clarify whether the published baselines used exactly the same Davis and KIBA splits as PAFDTA? Ideally, a controlled comparison with representative baselines under identical data splits would be needed to substantiate the claimed performance improvements.
Q2. How are proteins longer than 1,024 residues processed?
The explanation of window-based ESM2 feature extraction is helpful. However, the authors have not specified how the final 1,024 residue embeddings are selected when a protein exceeds this length. Please clarify the selection or aggregation strategy. I also note that the original concern regarding code availability has not been addressed. A public or anonymous implementation, including preprocessing and data-splitting scripts, would substantially improve reproducibility.
Q4. Do the performance gains come from fusion itself or from additional input information?
The Sum and Concat ablations provide useful evidence that the proposed fusion mechanism improves regression performance over simple aggregation. However, they do not fully establish the novelty of the overall framework, which integrates several established representation learning components. I would appreciate a clearer explanation of what constitutes the central methodological innovation beyond combining existing techniques. In addition, the improvements in MSE and R² appear relatively small. Are these differences consistent across multiple random seeds or statistically significant?
Q5. Could training and test sets contain the same drugs or proteins?
I appreciate the distinction between ranking performance and numerical prediction accuracy. Nevertheless, the higher CI but substantially worse MSE and R² in the KIBA double-cold setting remains a concern. Since the primary task is affinity regression, strong ranking performance alone does not establish superior generalization to unseen drugs and targets. Could the authors provide a more detailed analysis of the numerical prediction errors in this setting, including whether the model exhibits systematic bias or calibration issues?
Response to Reviewer bngu's Follow-up Comments— Part 1 (Q1–Q2)
We thank the reviewer for the careful follow-up and appreciate the opportunity to clarify the experimental protocol and implementation details.
Q1. Baseline comparisons and data partitioning
The baseline results in Table 1 were taken from the respective publications. Therefore, we do not claim that every baseline was trained on exactly the same hardware or identical fold assignments as PAFDTA. Table 1 provides a comparison with representative published methods, rather than a fully controlled reproduction of all competing approaches.
For PAFDTA, we used five-fold pairwise cross-validation with a fixed random seed of 42 on Davis and KIBA. The five held-out test folds are mutually disjoint and collectively cover all observed drug–target pairs, with no pair appearing in both the training and test partitions of the same fold.
Importantly, the relational path features are constructed using the training interactions of the corresponding fold, rather than the held-out interaction labels. This preserves the separation between training and test interactions when constructing the relational representations.
We also provide controlled architectural comparisons in Table 3, where the model variants are evaluated under the same data partition and input setting. These experiments are intended to isolate the contribution of the proposed components, independently of the cross-publication comparisons in Table 1.
We agree that reproducing additional published baselines under identical partitions would provide a stronger basis for direct model-to-model comparisons. Accordingly, we interpret Table 1 as evidence of competitive performance relative to published results, while distinguishing it from the controlled comparisons within PAFDTA.
Q2. Processing proteins longer than 1,024 residues and implementation availability
We thank the reviewer for requesting a more precise explanation.
PAFDTA uses frozen ESM2-t30-150M-UR50D to extract 640-dimensional residue-level representations. For protein sequences exceeding the ESM2 window limit, feature extraction is performed using consecutive, non-overlapping windows of 1,022 residues. The resulting embeddings are concatenated in their original sequence order to reconstruct the residue-level representation.
The downstream model applies a maximum protein length of 1,024 residues. Specifically, when a protein exceeds this length, we retain the first 1,024 residue embeddings from the N-terminus. No random residue sampling, center cropping, or full-sequence pooling is used for this truncation. Shorter sequences are padded with corresponding masks.
Thus, the 1,022-residue window length concerns ESM2 feature extraction, whereas the 1,024-residue limit controls the computational cost of downstream sequence processing. These are two distinct operations.
Regarding reproducibility, the anonymized supplementary materials contain the reference model and training implementation, configuration files, dataset resources, fold files, and fold-specific relational features. We agree that complete preprocessing and exact split-generation scripts would further facilitate end-to-end reproduction, and appreciate the reviewer's emphasis on this point.
Response to Reviewer bngu's Follow-up Comments— Part 2 (Q3–Q4)
We appreciate the reviewer's further questions regarding the methodological contribution and the interpretation of numerical prediction performance.
Q4. Methodological novelty and the contribution of fusion
We agree that individual representation-learning components such as GIN, ESM2, and Transformer encoders are established techniques. The central contribution of PAFDTA is not the invention of these components independently, but their coordinated learning through topology-guided cross-branch alignment and progressive interaction modeling.
Regarding the contribution of fusion itself, the Sum and Concat variants in Table 3 retain the underlying representation branches while replacing the proposed fusion strategy. PAFDTA achieves an MSE of 0.2018 and an R² of 0.7376, compared with 0.2084/0.7313 for Sum and 0.2064/0.7339 for Concat. These results indicate improved numerical regression performance under the evaluated setting without introducing additional representation sources.
We additionally performed targeted single-fold experiments examining the two fusion stages. Under the same Davis fold-0 protocol, the full model achieved an MSE of 0.2078, compared with 0.2185 when Stage-I weights were fixed uniformly, 0.2148 when Stage-II expert weights were fixed uniformly, and 0.2182 when the multiplicative expert was removed. These results provide further descriptive evidence concerning the roles of the two stages.
We distinguish these controlled observations from statistical significance across independent training runs. The fusion-specific comparisons have not established multi-seed statistical significance, and test-pair bootstrap uncertainty should not be interpreted as training-seed variability. Our methodological claim therefore concerns the coordinated alignment and integration framework, supported by the reported architectural comparisons, rather than universal superiority of an individual fusion operator.
Q5. Numerical prediction errors in the KIBA double-cold setting
We thank the reviewer for emphasizing numerical affinity prediction. We agree that CI alone is insufficient to characterize regression generalization, and therefore conducted an additional analysis of the 4,637 KIBA double-cold test pairs.
To assess whether the model retains meaningful numerical predictive information under simultaneous drug and target novelty, we additionally compared it with a constant predictor based on the training-set mean affinity. This reference predictor obtains an MSE of 0.6737 and an MAE of 0.5596. PAFDTA reduces these errors by 19.3% and 8.8%, respectively.
This comparison demonstrates that the model provides nontrivial numerical predictions beyond a constant reference, even when both entity types are unseen during training.
We also examined the residual distribution to investigate potential systematic bias. The overall mean signed error, defined as prediction minus ground truth, is −0.0752, while the median absolute error is 0.3467. The standard deviation of predicted affinities is 0.7225, compared with 0.8185 for the ground-truth values.
The errors are not distributed uniformly across affinity ranges. In the middle affinity ranges, the mean absolute errors are approximately 0.35, whereas the highest-affinity quintile has an MAE of 0.9584 and a mean signed error of −0.7065. This indicates a tendency toward prediction-range compression, particularly underestimating high-affinity interactions.
These observations help explain why the model retains useful pairwise ranking performance while its absolute regression accuracy does not reach the best competing result in the double-cold setting. The residual analysis is descriptive and does not constitute a formal guarantee of probabilistic calibration.
Overall, the additional analysis establishes that PAFDTA retains meaningful numerical predictive information under simultaneous drug and target novelty, while identifying high-affinity estimation as the primary source of remaining regression error.
We appreciate the reviewer's constructive comments and hope these additional implementation details and quantitative analyses clarify the contribution and empirical behavior of PAFDTA.
Response to Reviewer bngu
We sincerely thank the reviewer for the constructive feedback and for recognizing the integration of molecular, protein, pair-context, and relational representations in PAFDTA. We would like to clarify several aspects of the experimental protocol and the specific contributions of the framework.
Q1. Were the baselines trained using the same machine and data partitioning as PAFDTA?
The baseline results in Table 1 are taken from their respective publications, following the reporting convention of previous DTA benchmark studies. They were not all re-trained under an identical hardware and preprocessing environment. We therefore interpret Table 1 as a literature-based comparison rather than a strictly controlled common-protocol comparison.
Our own PAFDTA results are obtained using five-fold pair-wise cross-validation with a fixed seed of 42, a 200-epoch schedule, and final-epoch evaluation. The five test folds are mutually exclusive and collectively cover every observed drug-target pair exactly once.
Q2. How are proteins longer than 1,024 residues processed?
Protein features are extracted using the frozen ESM2-t30-150M-UR50D model, producing 640-dimensional residue embeddings. During feature extraction, long sequences are processed in windows to accommodate the ESM2 token limit. The downstream DTA model receives at most 1,024 residue embeddings per sample, which are projected into the model's 192-dimensional hidden space.
Q3. Why can removing CBCA or the relational prior improve CI? What is the contrastive temperature?
CBCA and the relational prior contribute to the model through representation regularization and contextual information, respectively. Their contribution is not limited to maximizing pairwise ranking.
As shown in Table 3, the Full model achieves the lowest MSE (0.2018) and highest R² (0.7376). Removing CBCA increases MSE to 0.2045, while removing the relational prior increases MSE to 0.2051. Both variants also have lower R² than Full.
The contrastive temperature in Equation 5 is τ = 0.07.
Q4. Do the performance gains come from fusion itself or from additional input information?
Our Sum and Concat experiments retain the representation branches while changing the fusion operation. Compared with these fixed alternatives, PAF achieves better numerical regression performance:
PAF: MSE = 0.2018, R² = 0.7376.
Sum: MSE = 0.2084, R² = 0.7313.
Concat: MSE = 0.2064, R² = 0.7339.
This controlled comparison supports the value of the learned progressive fusion mechanism beyond simply providing multiple input representations.
Q5. Could training and test sets contain the same drugs or proteins?
Our primary warm-start evaluation uses pair-wise partitioning. The five held-out folds are mutually exclusive and cover all observed interactions exactly once. Therefore, no identical drug-target pair occurs in both the training and its corresponding test set.
Drug or target identities may recur across training and test sets in warm-start evaluation, since the purpose is to predict unseen interactions involving known entities. In the separate KIBA cold-start experiments, drug and/or target identities are explicitly held out.
Q6. What additional value does PAFDTA provide beyond conventional DTA prediction?
In addition to affinity regression, we investigate uncertainty-aware candidate prioritization through split-conformal calibration.
We use 5,010 calibration pairs and a separate 5,010-pair test set. At a nominal 90% coverage level, the empirical coverage reaches 89.5%.
The screening pipeline progressively reduces the test candidates from 5,010 to 365, then 347, and finally 166 conformal-trusted candidates. Among the final 166 candidates, 154 are active, giving 92.8% precision and 36.9% recall. The selected set has approximately 11.1 times the active-pair rate of the original test set.
This extends the framework beyond point-wise affinity prediction toward uncertainty-aware candidate selection.
Q7. How do you interpret the KIBA double-cold results?
We distinguish ranking performance from numerical regression performance. CI evaluates whether the relative ordering of affinity pairs is preserved, while MSE and R² assess numerical prediction accuracy.
PAFDTA achieves the highest CI among the compared methods in all three KIBA cold-start settings:
Drug-cold: 0.791. Target-cold: 0.751. Double-cold: 0.687.
The drug-cold setting also achieves the best MSE and R² among the compared methods. Our interpretation is therefore that PAFDTA demonstrates competitive ranking transfer under entity-level cold-start conditions, rather than claiming universal superiority on every metric in every setting.
We hope these clarifications better communicate the motivation, evaluation protocol, and practical contribution of PAFDTA.