- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This work introduces Protein-TetSphere, a registered residue-wise volumetric representation for proteins. Specifically, it registers residue-wise protein volumes to a shared tetrahedral reference and encodes them in a common Laplacian basis, which can be viewed as a geometric representation learning strategy. The authors evaluate the proposed representation on three tasks, including ligand-binding pocket classification, protein–protein interface prediction, and de novo protein binder design, and report improvements across all three tasks. However, the baseline comparisons are limited. In particular, for ligand-binding pocket classification and protein–protein interface prediction, AtomSurf is the only main baseline, which provides relatively weak evidence for the overall competitiveness of the proposed method.
Critical strengths
- Protein-TetSphere explicitly models the three-dimensional volumetric organization within and around protein residues. The motivation is clear, and the idea is interesting.
- The method is evaluated on three protein representation-related tasks, providing relatively broad task coverage.
Critical weaknesses
- The number of baselines is limited. For pocket classification and PPI prediction, the comparisons mainly include AtomSurf, Ours w/o TetSphere, and Ours, although the related work discusses several relevant geometric models, such as MaSIF, dMaSIF, HMR, ScanNet, and PeSTo. The matched comparisons help demonstrate the additional value of TetSphere, but they do not fully establish the competitiveness of Protein-TetSphere against a broader range of existing methods.
- The paper presents Protein-TetSphere as a general representation learning approach, but separate pretrained models are trained for different downstream tasks, rather than learning a single protein representation that can be directly transferred across tasks.
- The construction of Protein-TetSphere appears to involve relatively high computational cost. The authors could provide further analysis and clarification on its computational efficiency and scalability.
Questions for authors
- The authors should clarify the rationale behind the baseline selection and more clearly explain the key methodological innovation that distinguishes Protein-TetSphere from the original TetSphere representation.
- The computational cost and time complexity should be reported more explicitly. An effective method should not introduce substantial computational overhead for only limited performance gains, especially for proteins, where 3D structural information is already computationally expensive to process.
- Protein binder design is one of the key evaluation tasks, but the paper does not provide a clear case study demonstrating that the proposed strategy produces better binders than the baseline methods.
2 comments
The authors claim substantial improvements across three related tasks. However, for the first two tasks, AtomSurf is the only backbone baseline considered. This makes it difficult to determine whether the improvements reflect the effectiveness of the proposed method or simply address limitations specific to AtomSurf. The authors' response has not fully resolved this concern. Therefore, I will maintain my original rating.
Rebuttal
W1 / Q1 — Baseline selection and relationship to TetSphere Splatting
Our method improves all three prediction metrics over both AtomSurf and the matched control without volumetric input, with the released backbone held fixed (Appendix C; Tables 1–2, mean ± SD over five seeds). These results show that registered volumetric geometry provides complementary information. We deliberately select strong backbones: AtomSurf reports state-of-the-art MaSIF-ligand balanced accuracy of 0.88 (0.84 without ESM; Mallet et al., 2025), and BoltzGen offers an open all-atom generator with experimentally validated binders in its original study (Stark et al., 2025). Our adaptation of TetSphere Splatting establishes shared residue-wise coordinates: one fixed-topology template preserves vertex correspondence; bidirectional point-to-point fitting to local surfaces and point-to-triangle fitting to chain-derived residue regions replace rendering losses; two-stage optimization adds per-update Gauss–Seidel volume repair. A common Laplacian basis then provides comparable deformation descriptors for learning (Sections 3.1–3.2, Appendix A.3).
W2 — Task-specific pretraining and transfer
We demonstrate the same representation's utility in pocket classification, interface prediction, and binder design. Task-specific pretraining is a deliberate safeguard against leakage. For the two prediction tasks, we pretrain only on their training splits and select checkpoints on validation data, excluding test data from both. Pocket pretraining masks ligand identity and disables ligand-related targets; interface pretraining masks cross-chain geometry to prevent direct label leakage. These strict controls address the risk identified by Hermann et al., 2024. Protocols appear in Sections 2 and 4.1 and Appendices B–D.
W3 / Q2 — Construction cost and scalability
Table 8: Mean per-chain time and CPU use. GPU time is amortized over fitting batches.
Table 9: Medians by residue count. A separate timing set supplies estimates with GPU batch time allocated by residue count.
Q3 — Binder case study
Under the same selection rule, our selected PDL1 binder scores better than +Cont. on all three AF2 interface and geometry metrics (Figure 14, Appendix I.4). In each arm we select the highest interface pTM among ProtDBench AF2-IG Easy passers across evaluated lengths, breaking ties by lower interface PAE, candidate identifier, then sequence index. Both complexes use the same target alignment, view, and scale; structures and metrics come from ProtDBench AF2.
Our method also achieves higher backbone success when all evaluated PDL1 lengths are pooled (Table 10):
We plan to contact wet-lab collaborators to validate binding and measure the affinities of the designed candidates.