- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
MCTH uses Monte Carlo Tree Search to allocate folding evaluations across biomolecular sequence–structure design trajectories. Each expansion proposes sequences through inverse folding, predicts their structures, and evaluates the resulting complexes. The CU-PUCT selection rule combines action values with consensus, uncertainty, and optional biophysical signals. The experiments cover RNA and DNA aptamers, protein binders, and ligand-conditioned protein design, with controlled search comparisons, held-out structure predictors, and Rosetta interface evaluation.
Critical strengths
-
Retaining alternative sequence–structure trajectories helps MCTH use a fixed folding budget more effectively. Appendix E.3 compares search strategies under the same initialization, proposal models, scoring, and folding oracle. Across the controlled subsets of three RNA, three DNA, and two protein targets, mean best search-time ipTM increases from 0.784 with greedy cycling to 0.913 for RNA, from 0.828 to 0.955 for DNA, and from 0.928 to 0.938 for proteins (Tables 15–17). These results support the value of revisiting earlier hypotheses and refining different branches instead of committing evaluations to a single trajectory.
-
The reported gains transfer to predictors outside the search loop. Under AlphaFold3 evaluation, MCTH achieves higher mean ipTM than ODesign for both RNA and DNA aptamers (Tables 4b and 6b). Adding AlphaFold2 during protein-binder search increases mean best Chai-1 ipTM from 0.18 to 0.57 across eleven targets, taking the best score among three retained designs per target (Table 8). Chai-1 is excluded from proposal generation, search, and archive ranking (Appendix E.6). On six shared protein-binder targets, MCTH designs generated with the physical term disabled also have area-normalized Rosetta interface energies comparable to RFdiffusion (Appendix E.7 and Table 25).
Critical weaknesses
-
The paper does not demonstrate that CU-PUCT’s consensus, uncertainty, and physical terms improve upon a conventional tree policy using the same models and rewards. Equation 4 combines these factors in the exploration bonus, but setting the exploration constant to zero removes the entire bonus. This comparison establishes the value of exploration without showing why the proposed selection factors are needed. The dual-expert experiment also changes both the evaluation objective and the consensus/disagreement signals. Its Chai-1 improvement could therefore result from optimizing the combined Boltz-2/AlphaFold2 objective, without requiring the proposed selection rule. No direct comparison establishes the benefit of physical guidance either. The results support adaptive search, but do not establish the additional benefit of the proposed selection and guidance mechanisms.
-
The reported final-design yield is measured on outputs selected from pooled search runs, but the aggregate folding budget used to produce these outputs is not specified. Appendix E.6 pools candidates from available dual-expert runs, removes duplicate sequences, and retains the highest-ranked candidates using the recorded search reward. RFdiffusion contributes ten generated outputs per target. The authors acknowledge that equal output counts do not imply equal compute (Table 2). The 37.3% versus 20.0% Chai-1 pass fractions establish a higher pass rate for the reported MCTH archive, but do not show whether this advantage persists under equal total generation and selection budgets. Both methods obtain at least one pass on eight of eleven targets.
Questions for authors
-
Can the authors compare CU-PUCT with standard PUCT using the same proposals, evaluation objective, and folding-call budget? In the dual-expert setting, the control should retain both Boltz-2 and AlphaFold2 in the reward so that the comparison tests the selection rule rather than the choice of evaluation models. Separately, which physical operators were enabled in the reported DNA experiments? Comparing the existing procedure with these operators disabled would help determine whether physical guidance improves held-out scores or physical feasibility beyond confidence-based search.
-
How many runs and total folding calls contributed to each reward-ranked archive in Appendix E.6? Does the final-design yield advantage persist when the total generation budget and the opportunity to rank and retain candidates are matched? A comparison using a common output-selection procedure, without access to Chai-1 scores, would help establish whether MCTH produces a higher fraction of qualifying designs under comparable computational resources.
5 comments
Q2: “How many runs and total folding calls contributed to each archive? Does the yield advantage persist under matched budgets and a common selection procedure?”
We should have specified this protocol in the paper. Both MCTH and RFdiffusion were evaluated under a budget of 100 folding calls per target, with 10 final designs retained from each pipeline. MCTH ranks candidates with its in-loop joint reward; RFdiffusion uses its native output-selection procedure. Neither method uses Chai-1 for candidate selection; Chai-1 is applied afterward as a common held-out evaluator.
Under this protocol MCTH achieves 41/110 passing designs (37.3%) against 22/110 (20.0%) for RFdiffusion, a 1.86× higher pass rate. Both methods achieve at least one passing design on 8 of 11 targets.
The folding budget and the output count were therefore already matched, with each method using its own native selection mechanism. We will state this in the revision, since the submission reported the pass rates without the budget behind them.
On the dual-expert setting for protein binders: not covered here, for the compute reasons in the Global Response.
Official Comment by Reviewer 6YTF
Thank you for the additional results. I have acknowledged them. The DNA/OpenFold3 ablation is useful, but I still cannot determine how much of the original protein-binder improvement comes from CU-PUCT rather than the combined Boltz-2/AlphaFold2 reward. Could you check the existing logs and report how many runs went into each pooled archive, the total folding calls, and whether the 100-call budget includes all those runs? Please also describe the pass-rate result as a comparison of the two complete pipelines, as their output-selection procedures differ.
Response to Reviewer 6YTF
Q1(a): “compare CU-PUCT with standard PUCT using the same proposals, evaluation objective, and folding-call budget”
We agree that setting the exploration constant to zero removes the entire bonus and does not isolate CU-PUCT from a standard tree policy. We ran the direct comparison on the 22 expanded nucleic-acid tasks at three seeds, with identical initialization, proposal models, scoring, and folding-call budget (Tables R1–R2, Global Response): CU-PUCT is above PUCT by +0.0145 (p = 0.035) and above UCT by +0.0188 (p = 0.0071).
Q1(b): separating the selection rule from the evaluation objective
We ran the 2×2 control. The second expert (OpenFold3) is either absent, used only in the reward, used only in the consensus/disagreement term, or both. The
reward onlyarm keeps the combined evaluation objective but uses a standard selection rule.Table R4. Dual-expert ablation, 11 DNA targets. Following the Table 8 protocol: one design is selected from each of three seeds (11, 23, 47); each predictor column reports the highest ipTM among those three, and the mean averages the 11 target-level maxima. The maximizing design may differ across predictors. All arms use 100 inverse-folding and 100 folding calls per target per seed. AF3 and Chai-1 are excluded from proposal generation, search, and ranking.
The full configuration is best under both predictors. The gain over a single expert (+0.0673 AF3, +0.0291 Chai-1) comes from both components: the combined evaluation objective contributes +0.0500 / +0.0067, and the consensus term a further +0.0173 / +0.0224. Per target, the full rule beats
reward onlyon 6 of 11 targets under AF3 and 7 of 11 under Chai-1; at this sample size the result is directional rather than statistically resolved.The consensus term helps when the second expert is also in the reward, but not on its own:
consensus onlystays close to the single-expert baseline (+0.0236 AF3, −0.0026 Chai-1). This matches the intended mechanism, since disagreement between experts carries information only once both actually score the candidates.Why the second expert enters late. Both experts run only after the first 60 folding calls; earlier expansions use a single expert, so the total budget matches the single-expert arm at 100 calls. The switch point is fixed across all targets and seeds, and was not tuned per target or against any held-out predictor. Two considerations motivate it. First, marginal returns per folding call are steepest early (Table 3B: +0.110 from 1 to 5 calls, +0.034 from 50 to 100), so spending two calls per node at that stage would halve the number of distinct candidates explored where exploration pays most. Second, early candidates are largely poor and both experts tend to score them low together, so the disagreement signal carries little information until candidates reach a range where the experts can differ. The ablation above is consistent with the second point.
Per-target results for all four configurations under both predictors are available and we will add them to the appendix.
Q1(c): “which physical operators were enabled in the reported DNA experiments?”
The submitted DNA experiments enabled only the ΔG_self reward penalty at ω = 0.1; sequence editing was not enabled. We ran the comparison the reviewer asks for — the same procedure with the penalty disabled, and with sequence editing enabled — in Tables R5–R6 under 739X W2.
On whether physical guidance improves held-out scores or physical feasibility beyond confidence-based search: physical feasibility, not confidence. Disabling the penalty gives the highest mean best ipTM (0.6887 at ω = 0), while enabling it with sequence editing gives the best post-repacking RosettaDNA score (+181.4 vs +323.5) and the fewest clashes (7 vs 17). Since the penalty adds a term to the optimized objective, we report the trade-off rather than only the configuration with the highest confidence score.