- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The central premise of this paper is that computational effort in protein binder design can be used more effectively by leveraging completed sampling trajectories rather than treating every generation attempt independently. The authors propose PRES-NPG, an inference-time framework that combines gradient-based structural guidance with evolutionary search over previously generated candidates. The method operates on pretrained protein generators without updating their parameters.
PRES-NPG introduces two complementary mechanisms. Normalized Proxy Guidance (NPG) modifies denoising updates using normalized gradients of differentiable structural objectives, including steric clash avoidance, compactness, interface contacts, and hotspot proximity. These gradients are computed from predicted clean structures without backpropagating through the denoiser. Prefix-Reuse Evolutionary Search (PRES) evaluates fully generated binders using a terminal fitness score, identifies the most promising candidates, and resumes their saved intermediate denoising states with fresh randomness to produce new generations. This allows the method to concentrate sampling around promising structural configurations while avoiding redundant computation.
The authors evaluate the framework using PXDesign-d and Proteina-Complexa, with experiments covering ProtDBench and an additional BindCraft-derived target panel. On ProtDBench, PRES-NPG improves AF2 ipTM from 0.7508 to 0.8061 and Boltz-2 ipTM from 0.8035 to 0.8321 relative to independent guided best-of-64 sampling for the eight retained designs. These improvements are accompanied by a substantial reduction in structural diversity, reflecting a trade-off between exploiting high-scoring regions and exploring distinct binder configurations. The authors also report that prefix reuse reduces denoising computation by approximately 60%, although the measured end-to-end execution is only 1.2 times faster. Overall, the study demonstrates how completed-candidate evaluations and local structural guidance can be integrated to improve the predicted quality of protein binders within a fixed candidate-evaluation budget.
Critical strengths
1. Well-controlled empirical evaluation of fitness-guided search.
The strongest aspect of this paper is its empirical evaluation of fitness-guided evolutionary search for protein binder design. The authors compare PRES-NPG against both random-parent branching and independent guided sampling under a matched candidate-evaluation budget, providing evidence that fitness-based parent selection improves predicted binder quality. The improvements are also observed using Boltz-2, partially mitigating concerns about overoptimization toward the AF2-based selection metric. Although the underlying search principles are not fundamentally new, the experiments provide useful evidence of their effectiveness in this application.
2. Practical integration with distinct pretrained protein generators.
The framework is demonstrated on both PXDesign-d and Proteina-Complexa, representing diffusion-based and flow-matching-based generation, respectively. Its ability to operate without retraining the underlying models is a practical advantage. The use of saved intermediate states also reduces redundant denoising computation, although the end-to-end runtime improvement is relatively modest. Overall, the paper's main strength lies in its empirical validation and practical implementation rather than methodological novelty. The experiments support the usefulness of fitness-guided trajectory reuse for improving computational binder-design outcomes, even though closely related search strategies have already been explored in prior work.
Critical weaknesses
1. Limited Methodological Novelty and Insufficient Comparison with Prior Work
The central ideas of fitness-guided evolutionary search and trajectory reuse have already been explored in prior studies, including Diffusion-ES and Diffusion Tree Sampling. Although PRES-NPG introduces a specific implementation based on resuming saved intermediate states, its methodological advancement over existing approaches remains unclear. The absence of direct comparisons with closely related search algorithms makes it difficult to establish the significance of the proposed contribution.
2. Inconclusive Evidence for the Benefit of Fitness-Guided Parent Selection
One of the paper's central claims is that selecting promising parents based on completed-candidate fitness improves subsequent generation. However, on the additional BindCraft-derived benchmark, the improvement over random-parent branching is not statistically conclusive. The reported 95% confidence interval for the retained-set AF2 ipTM difference includes zero (−0.0145 to +0.0762). Although the main ProtDBench results are favorable, this uncertainty raises questions about the robustness and generalizability of the proposed fitness-guided selection strategy.
3. Incomplete Computational Efficiency Comparison
The primary comparisons use the same number of evaluated candidates rather than equivalent computational budgets. While prefix reuse reduces denoising computation by approximately 60%, the actual end-to-end runtime improvement is only about 1.2 times. It remains unclear whether PRES-NPG would maintain its performance advantage over alternative sampling strategies under matched wall-clock time or GPU budgets.
Questions for authors
1. Methodological Advancement over Prior Work
How does the proposed prefix-reuse strategy differ fundamentally from existing evolutionary diffusion search and trajectory-reuse methods, such as Diffusion-ES and Diffusion Tree Sampling? Beyond avoiding re-noising of completed samples, what specific algorithmic advantage does PRES provide? Could the authors provide a direct comparison with closely related approaches under matched computational budgets?
2. Statistical Robustness of Fitness-Guided Parent Selection
On the additional BindCraft-derived benchmark, the improvement of PRES-NPG over random-parent branching in retained-set AF2 ipTM has a 95% confidence interval of [−0.0145, +0.0762], which includes zero. Given that fitness-guided parent selection is a central component of the proposed framework, how do the authors interpret this statistically inconclusive result? Would additional targets or independent runs help establish whether fitness-based selection consistently outperforms random selection?
3. Computational Efficiency under Matched Budgets
The experiments match the number of evaluated candidates rather than total computational cost. Although prefix reuse reduces denoising computation by approximately 60%, the reported end-to-end speedup is only about 1.2 times. Would PRES-NPG still outperform independent guided sampling if both approaches were allocated the same wall-clock time or GPU budget?
6 comments
Title: Author Response To Reviewer (2/3)
W2: Inconclusive Evidence for the Benefit of Fitness-Guided Parent Selection. One of the paper's central claims is that selecting promising parents based on completed-candidate fitness improves subsequent generation. However, on the additional BindCraft-derived benchmark, the improvement over random-parent branching is not statistically conclusive. The reported 95% confidence interval for the retained-set AF2 ipTM difference includes zero (−0.0145 to +0.0762). Although the main ProtDBench results are favorable, this uncertainty raises questions about the robustness and generalizability of the proposed fitness-guided selection strategy.
We agree that the original BindCraft comparison did not establish a clear average advantage over random-parent branching. That comparison included eight targets and two seeds per target, as stated in the Table 7 in Appendix E. We therefore evaluated two additional independent seeds on each of the same eight targets. When analyzed separately, the additional runs showed a positive mean difference with a 95% bootstrap confidence interval excluding zero. The combined four-seed analysis also favored PRES-NPG, with positive target-level mean differences on all eight targets.
Table 2a. Retained-eight AF2 ipTM, PRES-NPG − random-parent branching, BindCraft panel. Positive values favor PRES-NPG. bold = the interval excludes zero.
| Analysis | Targets × seeds | Paired target–seed cells | PRES-NPG − random-parent: AF2 ipTM [95% CI] | Positive target means |
|---|---|---|---|---|
| Original submission | 8 × 2 | 16 | +0.0293 [−0.0145, +0.0762] | 7/8 |
| New independent seeds only | 8 × 2 | 16 | +0.0815 [+0.0204, +0.1730] | 8/8 |
| Combined analysis | 8 × 4 | 32 | +0.0554 [+0.0155, +0.1193] | 8/8 |
The benefit nevertheless varies across runs. CLDN1 illustrates this variability: two seeds favor each method, and its four-seed average advantage is small.
Table 2b. Mean AF2 ipTM of the retained eight candidates for bcCLDN1, by seed.
| Seed | PRES-NPG | Random-parent branching | PRES-NPG − random-parent |
|---|---|---|---|
| 30011 | 0.83875 | 0.62000 | +0.21875 |
| 30012 | 0.30500 | 0.70625 | −0.40125 |
| 30013 (additional) | 0.52875 | 0.58625 | −0.05750 |
| 30014 (additional) | 0.65625 | 0.34750 | +0.30875 |
| Four-seed average | 0.58219 | 0.56500 | +0.01719 |
Exploratory lineage analysis of the four CLDN1 seeds found that high AF2 scores clustered within families, while scores among parents with AF2 ipTM below 0.5 showed little association with offspring AF2 scores. This suggests that variability partly reflects which productive lineages emerge and survive selection. Overall, the results strengthen evidence for an average retained-set AF2 gain on this panel.
W3: Incomplete Computational Efficiency Comparison. The primary comparisons use the same number of evaluated candidates rather than equivalent computational budgets. While prefix reuse reduces denoising computation by approximately 60%, the actual end-to-end runtime improvement is only about 1.2 times. It remains unclear whether PRES-NPG would maintain its performance advantage over alternative sampling strategies under matched wall-clock time or GPU budgets.``
We agree that matching the number of scored candidates does not establish equivalent computational cost. In the original 64-candidate comparison, prefix reuse reduced the denoiser-step count by 60%, while the measured end-to-end speedup was 1.20× after including scoring and initialization (Appendix G, p. 22; runtime breakdown in Table 12).
To address this concern, we added a timing-model-adjusted comparison across ten targets and three seeds per target. Using measured pipeline runtimes under paired concurrency settings on shared GPUs, we estimated how many independent candidates could be generated and evaluated within each paired PRES-NPG run’s measured elapsed time. The comparison includes a single-invocation guided baseline, with initialization charged only once.
For each budget-adjusted candidate set, we evaluated the mean AF2 ipTM of the eight highest-scoring candidates, without a structural-diversity constraint. We calculated 95% confidence intervals by bootstrapping target-level paired mean differences after averaging seeds within each target.
Title: Author Response To Reviewer (3/3)
Table 3a. Timing-model-adjusted comparison at PRES-NPG’s measured wall-clock budget across ten targets and three seeds.
| Method | Median designs counted | Top-eight AF2 ipTM | PRES-NPG − baseline [95% CI] |
|---|---|---|---|
| PRES-NPG | 64 | 0.790 | — |
| Independent guided, repeated batches | 48 | 0.728 | +0.0621 [0.0333, 0.0952] |
| Independent unguided, repeated batches | 48 | 0.683 | +0.1069 [0.0580, 0.1613] |
| Independent guided, single invocation | 62 | 0.740 | +0.0497 [0.0264, 0.0745] |
PRES-NPG achieved higher mean retained-eight AF2 ipTM than all three baselines, with all three 95% confidence intervals excluding zero. The advantage persisted against the single-invocation guided baseline (+0.0497; 95% CI [0.0264, 0.0745]). These results support an advantage under the estimated end-to-end time budgets and shared-GPU conditions tested here.
Q1: Methodological Advancement over Prior Work. How does the proposed prefix-reuse strategy differ fundamentally from existing evolutionary diffusion search and trajectory-reuse methods, such as Diffusion-ES and Diffusion Tree Sampling? Beyond avoiding re-noising of completed samples, what specific algorithmic advantage does PRES provide? Could the authors provide a direct comparison with closely related approaches under matched computational budgets?
Please see W1 and Table 1 for the methodological distinctions and comparisons with the Diffusion-ES and DTS-L adaptations. Beyond checkpoint reuse, PRES assigns fixed continuation quotas to selected parents, ensuring that each selected parent receives fresh continuations and making allocation deterministic conditional on parent selection. These search-method comparisons use a matched scored-candidate budget. W3 and Table 3a separately assess independent sampling under timing-model-adjusted wall-clock budgets.
Q2: Statistical Robustness of Fitness-Guided Parent Selection. On the additional BindCraft-derived benchmark, the improvement of PRES-NPG over random-parent branching in retained-set AF2 ipTM has a 95% confidence interval of [−0.0145, +0.0762], which includes zero. Given that fitness-guided parent selection is a central component of the proposed framework, how do the authors interpret this statistically inconclusive result? Would additional targets or independent runs help establish whether fitness-based selection consistently outperforms random selection?
As reported in W2 and Table 2a, we evaluated two additional independent seeds on each of the same eight BindCraft targets. Both the additional-seed analysis and the combined four-seed analysis yielded positive average differences with 95% bootstrap confidence intervals excluding zero. These results strengthen evidence for an average retained-set AF2 ipTM advantage and repeatability across independent runs on the same eight-target panel, although effects vary across seeds. They do not broaden the evaluated target distribution; generalization to additional targets remains to be tested.
Q3: Computational Efficiency under Matched Budgets. The experiments match the number of evaluated candidates rather than total computational cost. Although prefix reuse reduces denoising computation by approximately 60%, the reported end-to-end speedup is only about 1.2 times. Would PRES-NPG still outperform independent guided sampling if both approaches were allocated the same wall-clock time or GPU budget?
Please see W3 and Table 3a. Across ten targets and three seeds, PRES-NPG achieved higher mean retained-eight AF2 ipTM than independent guided sampling under the timing-model-adjusted wall-clock budgets. This advantage persisted against the single-invocation baseline, which incurs initialization only once (+0.0497; 95% CI [0.0264, 0.0745]). The timing accounting includes scoring and initialization.
We sincerely appreciate your deep engagement in reviewing our paper and your valuable feedback. Your suggestions have helped improve our paper in many aspects, and we hope that our detailed responses have addressed each of your concerns.
Title: Author Response To Reviewer (1/3)
Dear Reviewer czSb,
Thank you for your thoughtful comments. Key changes are highlighted in blue in the revised manuscript. We respond to your concerns below.
We thank the reviewer for this insightful suggestion. We agree that fitness-guided evolutionary search and reuse of intermediate states are established ideas, and we do not claim them as new. Our contribution is the integration and characterization of normalized structural-proxy guidance with fitness-guided allocation of fresh continuations for protein binder design.
PRES-NPG combines two complementary operations. Within each trajectory, NPG uses a differentiable structural proxy to determine the guidance direction and scales the guidance magnitude relative to the base denoising step. Across generations, PRES uses completed-candidate fitness to select which saved checkpoints receive additional continuations. This allows an external, potentially nondifferentiable evaluator to direct sampling while local guidance remains inexpensive and explicitly controlled.
Compared with Diffusion-ES: Diffusion-ES targets autonomous and instruction-guided driving, while PRES-NPG addresses protein binder design. PRES changes how subsequent candidates are initialized and allocated. Diffusion-ES re-noises selected completed outputs and uses stochastic reward-weighted resampling. PRES instead resumes recorded intermediate sampler states and allocates a fixed number of fresh continuations to each selected parent. These differences define the search policy. Their empirical effects are evaluated under the specified adaptations.
Compared with Diffusion Tree Sampling: Diffusion Tree Sampling studies reward-aligned image and text generation, while PRES-NPG targets protein binder design. PRES directly ranks completed trajectories from the current generation rather than maintaining recursively backed-up subtree values. It allocates equal continuation quotas to the selected saved states. Our comparison concerns the specified protein-domain adaptation, DTS-L, rather than all configurations of the original method.
Matched scored-candidate comparison. We compared PRES-NPG with re-noising under PRES allocation, a Diffusion-ES adaptation, and a DTS-style adaptation denoted DTS-L. All methods used the same generator, NPG guidance, fitness evaluator, branch schedule, and final-retention rule, with 64 scored candidates per target–seed run.
Table 1. Whole-pool search comparisons at a matched budget of 64 scored candidates per run on ProtDBench (ten targets. 30 paired target–seed cells per cohort). Scores average all candidates before final retention. Δ: PRES-NPG − comparator.
Table 1 shows positive whole-pool AF2 and held-out Protenix-mini binder ipTM differences against all three tested adaptations in both cohorts. The re-noising comparison supports checkpoint reuse under the tested allocation and mutation settings. These results concern whole-pool predicted quality at equal scored-candidate count.