- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposes GraSPPI, which uses training-network topology in two ways. First, a sequence-conditioned module predicts a small virtual graph representing shared-neighbor structure, which supplies attention prefixes to a pairwise predictor. Second, ranking, degree, and motif losses supervise predictions jointly on sampled training subgraphs. A two-stage procedure first teaches the predictor to use observed motif graphs and then adapts it to inferred graphs. Test-time prediction requires only the two protein sequences.
Critical strengths
- The problem formulation is useful, and the method respects the intended inference constraint. Predicting individual interactions and reconstructing a useful network are different objectives. The paper directly addresses this distinction while allowing both queried proteins to be unseen and have no recorded interactions. The combination of topology supervision during training and sequence-only inference is practically meaningful.
- The reconstruction results are promising, and the appendix provides informative diagnostics. GraSPPI achieves the best average rank in Table 1 and the lowest clustering discrepancy across all three PRING splits. The inferred path-product statistic remains associated with its target on unseen proteins, including after controlling for endpoint degrees: the reported test correlation changes only from 0.400 to 0.384. The density-matched experiment also shows improved edge recovery. The authors deserve credit for reporting limitations that qualify their own results.
Critical weaknesses
- The ablations do not isolate the contributions of the proposed components. Removing the motif prompt also changes the training streams and optimization schedule, while removing all structural losses eliminates the entire structural stream, including its cross-entropy supervision. Moreover, removing motif-graph supervision leaves prompt inference untrained because of the stop-gradients. These comparisons cannot establish whether the improvements arise from the proposed mechanisms, additional training examples, or optimization differences, weakening the evidence for the method’s central contributions.
- The evidence for improved topology beyond density is limited. Section 6.3.4 shows that the topology-discrepancy advantage largely disappears when predicted densities are matched; at relative density one, GraSPPI’s aggregate MMD discrepancy is slightly worse than that of the variant without structural losses (6.34 versus 5.83). Although improved edge recovery and threshold transfer remain valuable, these findings do not establish that the structural losses improve network topology beyond their effect on density. This distinction is consequential because structurally faithful reconstruction is a central claim of the paper.
Questions for authors
- Clarification of the ablations: Section 6.1.4 indicates that several ablations also change the training streams or optimization schedule. Do you have controlled comparisons that retain both streams, their cross-entropy supervision, and comparable training budgets while removing only the motif prompt or structural regularizers? These results would help establish which components account for the improvements.
- Evidence for motif-graph supervision: Have you compared against a prompt trained through the interaction objective, with the relevant stop-gradient removed, rather than a prompt frozen at initialization? Does explicit motif supervision outperform this alternative?
- Interpretation of the topology gains: At matched density, Section 6.3.4 reports that the aggregate MMD advantage disappears, although edge recovery improves. What evidence supports a topology benefit beyond improved density transfer? Do separate degree, clustering, and spectral comparisons at matched density support this interpretation against the strongest baselines?
2 comments
3. Topology gain beyond density.
First, we respectfully clarify the claim. The paper does not claim that the structural losses improve the shape of the network independently of its density. The claim is about reconstruction at inference: each test pair is scored independently, one threshold is frozen on , and the network that these decisions form is closer to the true test network. The structural losses serve this claim during training, where they make the decisions on sampled training subgraphs form a network that follows the structure of the training network (abstract and the second contribution). Density is part of the structure of a network, so a comparison at matched density does not test this claim, for three reasons:
- Density error is the distortion that the paper sets out to correct. At their published thresholds, TUnA and PLM-interact (35M) predict 2.2 to 4.4 times the true density, and every discrepancy rises with it (Section 4.3).
- The losses supervise density by design. matches the expected degree of each protein to its true degree, and the degrees fix the edge count. A comparison at matched density thus removes the quantity that the losses are trained to correct.
- A matched-density comparison is not available at inference. The test density is unknown, and the comparison needs the test labels.
Second, we give the comparison that the reviewer asks for, as a diagnostic to determine which gains persist when density is held fixed. For the regularizers, Section 6.3.4 of the revision now uses the controlled variant without the three regularizers, in place of the earlier variant that removed the structural stream. On BFS at relative density 1, GraSPPI has higher graph similarity than this variant (0.415 against 0.371), and all three MMD ratios are numerically higher for GraSPPI (6.05, 5.71 and 7.36 against 5.44, 5.53 and 6.71). For the baselines, Table R7, which is Table 12 in Section 6.3.4 of the revision, gives the separate comparisons on the three splits.
Table R7. Baselines at test relative density 1, three splits. Columns per split: GS ↑, degree ↓, clustering ↓, spectral ↓. †: matched on the arithmetic mean of RD over the test subgraphs, because one of the 500 subgraphs has no predicted edge and the geometric mean used for the other cells is then 0. L3-PPI has tied scores, so its RD is 1.012, 0.968 and 0.963.
| Method | BFS GS | Deg. | Clus. | Spec. | DFS GS | Deg. | Clus. | Spec. | RW GS | Deg. | Clus. | Spec. |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| GraSPPI | 0.415 | 6.05 | 5.71 | 7.36 | 0.510 | 84.14 | 16.97 | 18.26 | 0.517 | 17.29 | 5.63 | 7.91 |
| TUnA | 0.411 | 3.87 | 4.60 | 6.89 | 0.498 | 107.59 | 25.84 | 23.26 | 0.534 | 16.12 | 5.21 | 8.55 |
| LLP | 0.426 | 3.89 | 4.24 | 6.53 | 0.455 | 125.48 | 28.09 | 25.58 | 0.560 | 22.47 | 8.32 | 11.44 |
| L3-PPI | 0.335 | 8.50 | 10.81 | 20.41 | 0.300 | 94.44 | 58.36 | 14.35 | 0.441 | 16.16 | 7.81 | 8.38 |
| PLM-interact (35M) | 0.422 | 13.93 | 8.96 | 11.18 | 0.448 | 179.22 | 44.28 | 27.57 | 0.496† | 45.62† | 12.85† | 15.27† |
| UniPrompt | 0.385 | 8.65 | 7.20 | 13.17 | 0.346 | 151.55 | 29.96 | 31.63 | 0.436 | 43.23 | 18.72 | 21.78 |
| SPRINT | 0.263 | 4.43 | 7.90 | 6.42 | 0.260 | 109.33 | 27.27 | 24.81 | 0.228 | 10.87 | 9.65 | 10.96 |
The matched-density results vary by split. GraSPPI has the highest graph similarity and the lowest degree and clustering discrepancies on DFS. On BFS, TUnA and LLP have lower discrepancies on all three measures. On RW, GraSPPI's spectral discrepancy is lower than either baseline's, while TUnA has lower degree and clustering discrepancies. The average ranks across the 12 columns are 2.33 for TUnA, 2.42 for GraSPPI, and 3.17 for LLP.
Under the deployed protocol, one threshold is selected on validation and applied unchanged to test. GraSPPI reaches relative densities of 0.894, 0.942, and 1.058 across the three splits. On BFS, removing the three regularizers moves relative density to 0.665. Also on BFS, TUnA and LLP reach relative densities of 0.569 and 0.369 with their validation-frozen thresholds, and both have higher MMD ratios than GraSPPI (Table 1). These results support two specific benefits of the regularizers: the validation-selected threshold transfers to a density closer to the true one, and edge overlap improves even when test density is matched.
1. Controlled ablations that keep both streams and the training budget.
We agree that the original ablations changed the training setup. The revision adds two controlled ablations on PRING BFS. Both keep the 1:5 task-pair stream, the structural subgraph stream, binary cross-entropy on both streams, and the training schedule of GraSPPI. Each one removes a single component, and each row of Table R5 uses its own Vval-frozen threshold.
Table R5. Controlled ablations, BFS test.
Section 4.5 and Table 4 of the revision report these comparisons, and Section 6.1.4 ("Ablation variants") states the streams and losses that each run keeps.
2. Prompt trained through the interaction objective.
The revision adds a task-trained prompt, in which the gradients of the predictor's losses reach prompt inference Pϕ. The cross-entropy on both streams and the three network-level regularizers (Lrank, Ldeg, Lmot), which together are LI, update Pϕ through the reader and the predictor. Table R6 compares it with explicit motif-graph supervision (GraSPPI) and with the frozen prompt. The three runs share the Stage I checkpoint, both streams, Ew=4 and the learning rates of GraSPPI, and differ in two settings only:
Table R6. Signal that trains the prompt, BFS test.
The task-trained prompt and the frozen prompt give nearly the same result on all five metrics. Explicit motif supervision gives much better density transfer (RD 0.894 against 0.606) and MMD ratios 1.4 to 1.5 times lower, with GS within 0.016 of the two alternatives. Explicit motif supervision thus outperforms the task-trained prompt in the network that the model reconstructs at the deployed threshold. Table 4 and Section 4.5 of the revision report this comparison, and Section 6.1.4 states these settings.