- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduces SARP for a partially latent all-atom protein generator. SARP combines endpoint-based DGPO with auxiliary flow-matching supervision on high-reward endpoints obtained through beam search. The reinforcement update operates on freshly re-noised generated endpoints rather than stored sampling trajectories, while searched endpoints are used as separate supervised targets. The method also uses moving-reference regularization and controls the duration of search supervision. Both the explicit Cα backbone and non-Cα latent flows are updated. The empirical evaluation covers four small-molecule binder conditions and five independently optimized enzyme-design targets. Comparisons include trajectory-based GRPO, DGPO, search-only supervised fine-tuning, rollout-derived endpoint supervision, and inference-time search. The paper reports improvements in computational design quality and structurally distinct successful designs under standard sampling, provides evaluation-only AlphaFold3 cross-checks, and analyzes how supervision duration and search strength affect optimization and diversity.
Critical strengths
The method improves the yield of structurally distinct successful designs, with meaningful cross-evaluator support. The enzyme results are stronger than an improvement in average reward alone. Under RF3 evaluation, SARP obtains an average pass rate of 69.4% and 42.2 unique passing structural clusters per 100 designs, compared with 54.4% and 35.6 for DGPO; the pretrained model yields 11.2 unique passing clusters. This makes the improvement relevant to generating a portfolio of candidate designs rather than repeatedly producing similar high-scoring outputs. The ablations identify a consequential quality–diversity distinction between supervision sources. The author account for distributed supervision frequency and the number of accepted endpoints, and distinguish this source-control experiment from an independently optimized competing method. In enzyme design, rollout-derived supervision achieves comparable or slightly better average geometric metrics, but yields 21.0 unique passing clusters versus 42.2 for search-derived supervision. Thus, the empirical value of search is not presented solely as stronger fitting of local geometry; it also concerns which successful structures the generator continues to sample.
Critical weaknesses
-
The practical advantage of search over cheaper endpoint supervision is not yet established under a matched total resource budget.This makes the additional cost of search important to the overall assessment. Moreover, the manuscript explicitly states that SARP-Rollout inherits SARP’s training horizons rather than being independently tuned, so this control does not establish the strongest achievable performance of the cheaper alternative. The doubled-group DGPO experiment is useful, but it does not establish equivalence in total generator computation or reward-evaluator calls. Appendix J reports relative inference-time search overhead, whereas the enzyme training budgets are explicitly not compute-matched. A complete accounting of post-training, search, and evaluation costs—and the number of subsequent designs needed to amortize those costs—is missing. This matters especially because enzyme models are optimized independently for each target. The current evidence supports improved standard-sampling quality, but not yet a general claim of better end-to-end efficiency than well-tuned rollout distillation or inference-time search.
-
The robustness of the incremental gains and the reproducibility of model selection are insufficiently quantified. The principal comparisons report point estimates without specifying independent post-training seed counts or providing run-level uncertainty. Generating 100 enzyme designs from a checkpoint measures sampling outcomes, but does not quantify variability across training runs. Checkpoint selection and supervision termination are described through qualitative conditions such as a “steep drop” in diversity. I appreciate that the final evaluation set is explicitly excluded from checkpoint selection; my concern is not demonstrated test-set leakage, but whether another implementation or training run would make the same stopping decisions. Quantitative stopping rules and repeated-run results would materially strengthen the claim that search reliably improves the quality–diversity trade-off.
Questions for authors
- Resource accounting and the search-specific benefit. What are the total generator evaluations, reward-evaluator calls, GPU-hours, and post-training costs for SARP, DGPO, and SARP-Rollout? For the target-specific enzyme setting, approximately how many subsequent designs are required before SARP becomes cheaper than using the pretrained model with inference-time search?
- Training variability and stopping decisions. How many independent post-training runs underlie the main tables? Please specify the numerical rule, smoothing window, and any patience criterion used to disable supervision and select checkpoints. Does the advantage in unique passing clusters persist across training seeds and when SARP-Rollout receives its own training-diagnostic-based stopping schedule, rather than inheriting SARP’s horizon?
- Enzyme geometry definitions . Appendix E.3 defines the backbone reward using the RMSD of the generated catalytic-motif backbone relative to its target geometry, whereas Section 4.2 describes success using RF3-refolded backbone self-consistency. Please specify the structures, atom sets, and alignment procedures used for the backbone reward, the “BB RMSD” column, and the backbone success criterion. Are these distinct quantities, or is the wording inconsistent? This distinction is necessary to interpret what is optimized versus independently evaluated.
3 comments
Response to Reviewer GzJP – Weakness 2 and Q2: Training Variability and Stopping Decisions
We appreciate the reviewer's concerns regarding training variability and stopping decisions. We clarify the training protocol and provide additional seed-sensitivity and training-dynamics analyses.
1. Training schedules and stopping criteria.
We clarify that search-supervision duration is an explicit training hyperparameter rather than an adaptive stopping criterion. No numerical diversity threshold, smoothing window, or patience criterion is used. The use of temporary supervision is supported by our empirical and optimization analyses. Our gradient analysis (Section 4.4 and Appendix Q) shows that Search-SFT becomes increasingly misaligned with DGPO during training, while our supervision-duration ablation (Appendix R, Table 23) demonstrates that prolonged search supervision can adversely affect structural diversity. Consistent with this concern, rollout diversity decreases by approximately 25% during the first 20 steps on M0732 and 16% on M0375, motivating us to turn off search supervision at step 20 rather than relying on a universal diversity threshold. Given the computational scale of all-atom protein post-training, we have not exhaustively optimized the turn-off step for each target. Nevertheless, the matched schedules and supporting analyses provide a controlled basis for evaluating the contribution of search-derived supervision.
2. Training variability across random seeds.
Due to the substantial computational cost, the main results are based on a single independent training run per method and target. Nevertheless, we evaluate SARP across multiple distinct design tasks, including small-molecule binder, enzyme, and DNA-binding protein design, and observe consistent improvements across these settings. Besides, to directly assess training-seed sensitivity, we additionally train SARP on enzyme target M0552 using a second random seed.
| Method | Steps | Cat. match ↑ | Cat. RMSD ↓ | BB RMSD ↓ | Lig. clash ↓ | Pass ↑ | Unique pass ↑ |
|---|---|---|---|---|---|---|---|
| SARP (seed 42) | 90(30) | 1.000 | 1.36 | 0.57 | 0.003% | 72% | 54 |
| SARP (seed 143) | 90(30) | 1.000 | 1.41 | 0.63 | 0.000% | 76% | 51 |
Both seeds achieve comparable pass rates (72% vs. 76%) and unique passing clusters (54 vs. 51), outperforming DGPO on M0552 (60% pass rate, 40 unique clusters). This provides preliminary evidence of robustness to training seeds.
3. SARP-Rollout stopping schedules and diversity dynamics.
SARP-Rollout uses the same training horizon and supervision schedule as SARP to isolate the effect of supervision source. We acknowledge that an independently optimized stopping schedule could affect its performance and have not conducted a comprehensive schedule sweep due to the long training time and cost. However, additional analyses suggest that checkpoint selection alone does not explain the diversity gap.
(a) Quality–diversity dynamics. On M0375, both methods improve backbone RMSD at similar rates, but exhibit different diversity trends:
| Method | Pearson r | Cluster slope / step | BB RMSD slope / step |
|---|---|---|---|
| SARP | −0.617 (n=27) | +0.042 | −0.0018 |
| SARP-Rollout | +0.677 (n=32) | −0.094 | −0.0020 |
SARP maintains or increases structural diversity as backbone RMSD improves, whereas SARP-Rollout tends to lose diversity.
(b) Diversity across training checkpoints. We examine training-rollout diversity throughout the observed post-supervision trajectories:
| Target | SARP mean | SARP worst | Rollout mean | Rollout best | Unique-pass gap |
|---|---|---|---|---|---|
| M0904 | 20.70 | 14.75 | 2.60 | 7.25 | +51 |
| M0375 | 21.37 | 15.62 | 7.51 | 19.12 | +10 |
| M0552 | 23.95 | 17.38 | 20.68 | 23.38 | +23 |
| M0157 | 21.53 | 15.12 | 25.55 | 28.62 | 0 |
On M0904, even SARP-Rollout's best observed diversity (7.25 clusters) is below SARP's worst (14.75), consistent with the evaluation-time unique-pass gap (52 vs. 1). On M0375, SARP maintains higher diversity at all 22 matched logged steps. The trend is weaker on M0552 and absent on M0157, indicating target-dependent benefits.
(c) Search-derived structural novelty. Our additional Foldseek analysis shows that 47.2% of accepted search clusters across three enzyme targets (W=8) are absent from concurrent ordinary rollout groups, with 45.1% novelty for small-molecule binders (W=2). This provides a complementary explanation for SARP's diversity advantage beyond selecting existing high-reward rollouts.
Overall, the additional seed experiment supports reproducibility on M0552, while the training-dynamics and structural-novelty analyses indicate that search-derived supervision provides diversity benefits beyond checkpoint selection. Independently optimized SARP-Rollout stopping schedules remain an open evaluation.
Further training-dynamics, supervision-duration, and structural-novelty analyses are provided in the revised appendix.
Response to Reviewer GzJP – Q3: Enzyme Geometry Definitions
We thank the reviewer for identifying this inconsistency. The wording in Appendix E.3 was misleading and has been corrected. The backbone reward, the BB RMSD column in Table 2, and the backbone success criterion all use the same RF3-refolded backbone self-consistency RMSD.
Specifically, the metric is defined as follows:
- Structures: The generated protein structure and its RF3-refolded structure, rather than the prescribed catalytic-motif target geometry.
- Atoms: The full protein backbone (N, Cα, C, O), not just the catalytic motif.
- Alignment: Optimal rigid-body superposition using the same backbone atoms over which RMSD is computed.
- Evaluation: Table 2 reports the median RMSD over 100 designs, with a backbone success threshold of ≤ 2.0 Å.
Thus, these are not distinct metrics. We have revised it in Appendix E.3.
Response to Reviewer GzJP – Weakness 1 and Q1: Resource Accounting and Search-Specific Benefit
We appreciate the reviewer's request for detailed computational accounting and more evidence for search's benefit. We report generator evaluations (NFEs), reward-oracle calls, training GPU-hours, and target-specific cost amortization. We have also updated the manuscript accordingly.
1. Computational cost.
With 32 rollouts and 400 denoising steps, DGPO and SARP-Rollout require 12,800 NFEs and 32 reward-oracle calls per rank-step. SARP incurs additional computation from reward-guided beam search, as quantified below. NFEs / rank-step denotes the number of generator evaluations per training step, and oracle calls counts reward evaluations. The corresponding multipliers indicate computational overhead relative to DGPO. Detailed NFE and reward-oracle accounting is provided in Appendix K.
Training GPU-hours per optimization step:
Total training GPU-hours, including subsequent RL-only optimization:
Per-step SARP costs apply to search-supervised steps. Full-supervision small-molecule SARP costs 718.2 GPU-h (W=2) or 1,513.5 GPU-h (W=8) over 200 steps.
2. Search-specific benefit and structural novelty.
SARP-Rollout replaces search-derived supervision with reward-selected on-policy endpoints under the same schedule. Across five enzyme targets, SARP achieves 42.2 unique passing clusters per 100 designs versus 21.0 for SARP-Rollout.
Besides, we jointly cluster accepted search candidates and concurrent rollouts using Foldseek (TM-score ≥ 0.5) to prove that search can find more novel passing structures. We define accepted novelty as:
Novelty=∣Caccepted∣∣Caccepted∖Crollout∣,
where Caccepted and Crollout denote structural clusters of accepted search candidates and concurrent ordinary rollouts, respectively.
Search discovers clusters absent from ordinary rollouts (47.2% for enzymes at W=8; 45.1% for small-molecule binders), providing structurally novel supervision.
3. Target-specific training–inference amortization.
On NVIDIA L40S GPUs, inference-time search requires 10.84× more GPU-hours per design than standard sampling (0.06374 vs. 0.00588 GPU-h/design), consistent with 4,000 versus 400 NFEs (10×). Accounting for pass rates, SARP requires 8.9–16.3× fewer marginal inference GPU-hours per passing design than pretrained inference-time search.
Including each checkpoint's full target-specific post-training cost:
GPU-h/pass excludes upfront training and is only for inference evaluation. Break-even calculations include full SARP training costs.
SARP amortizes training after 642–8,440 passing designs, or approximately 4,100–9,100 generated candidates at equal generation volumes. These scales are practical: previous studies generated 10,000–50,000 candidates for Ras isoform-selective binders and approximately 10,000 candidates for intrinsically disordered protein binders.
Full resource accounting, inference benchmarks, and amortization analyses are provided in Appendix K.