- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes AReUReDi, a training-free multi-objective peptide sequence optimization method. It uses a frozen Rectified Discrete Flow model to propose amino acid substitutions, combines annealed Tchebycheff guidance to prioritize weaker properties, and employs a monotone weighted-utility acceptance rule to prevent decreases in aggregate scores. The method is evaluated across multiple peptide design tasks, reporting improvements in predicted binding affinity, solubility, non-hemolysis, non-fouling, and half-life. The authors also demonstrate its applicability to both amino acid sequences and chemically modified peptide SMILES representations.
Critical strengths
1. A relevant problem formulation focusing on candidate-level multi-objective optimization.
The paper emphasizes balancing multiple properties within individual candidates rather than focusing solely on Pareto front coverage. Since peptide candidates must simultaneously satisfy binding and developability requirements, considering trade-offs at the individual-candidate level is a reasonable research direction. Combining the improvement of weaker properties with aggregate utility optimization is a potentially useful approach to multi-objective molecular design.
2. No generator retraining is required, with relatively broad experimental coverage.
The method supports adjustable optimization preferences using frozen generators and can be applied to different molecular sequence representations. The authors provide comparisons across multiple targets, component ablations, preference-control experiments, and predictor-refitting analyses, offering some evidence of effectiveness under the adopted scoring framework.
Critical weaknesses
1. The necessity of the proposed search algorithm and its methodological novelty are insufficiently demonstrated.
The core algorithm combines established techniques, including Tchebycheff scalarization, Barker-balanced proposals, annealed guidance, and greedy weighted-utility acceptance. Although this combination is reasonable, the overall approach remains closely related to existing multi-objective guided generation and local search frameworks. For example, MOG-DFM has explored multi-objective biological sequence optimization using discrete flow models, while PepTune and ParetoFlow have investigated the integration of generative models with multi-objective optimization. The paper therefore needs to better clarify its distinctive methodological contribution.
More importantly, the method already evaluates multiple amino acid substitutions using property predictors at each refinement step. This suggests that simpler search strategies, such as directly selecting the substitution with the highest weighted utility or performing greedy local search based on the worst-objective score, could potentially achieve similar results. Although the authors provide ablations on proposal distributions, annealing schedules, and acceptance rules, they do not directly compare against such simpler, complete search algorithms. It therefore remains unclear whether the proposed guidance and sampling mechanisms provide substantial benefits beyond straightforward local search, or whether the main improvements primarily arise from repeated property evaluations and candidate selection.
Furthermore, the theoretical results concerning invariance and concentration for an exact Metropolis–Hastings sampler do not directly apply to the monotone acceptance algorithm used in the experiments. The nondecreasing weighted-utility guarantee of the implemented algorithm follows directly from its acceptance rule, which further limits the significance of the theoretical contribution.
2. The connection between the primary evaluation metrics and practical candidate quality is insufficiently established.
Table 1 primarily evaluates the worst-objective score (Min.), objective range (Range), and dispersion (Dispersion). These metrics characterize closely related aspects of within-candidate balance and align strongly with the proposed weakest-property guidance mechanism. Consequently, leading on all three metrics does not necessarily demonstrate improvements across independent dimensions of candidate quality.
More importantly, the paper maps heterogeneous properties onto normalized scales using classifier outputs, affinity-score scaling, and transformations of predicted half-life. However, numerical normalization does not establish biological comparability across different properties. The lowest normalized score does not necessarily correspond to the most important practical limitation, and alternative reasonable normalization schemes could change the optimization priorities and method rankings.
Table S2 illustrates this concern. On 1B8Q, AReUReDi substantially improves several predicted developability properties compared with NSGA-III, but its predicted affinity score is lower (5.7130 versus 7.2178). This demonstrates a different property trade-off, but higher worst-objective scores or lower dispersion alone do not establish that the resulting candidates are globally preferable. Their practical value depends on whether individual properties meet acceptable thresholds and on the significance of the corresponding trade-offs.
Although the authors provide objective-level analyses and Pareto coverage results, they do not systematically evaluate the proportion of candidates simultaneously satisfying multiple practical design constraints. Moreover, AReUReDi does not consistently outperform competing methods in Pareto coverage, and its candidate-level balance advantage on 1B8Q disappears after predictor refitting. Therefore, the current evidence mainly supports improved balance under the chosen normalization and scoring framework, rather than a convincing improvement in overall candidate quality or practical developability.
3. The experimental comparisons do not sufficiently isolate the benefits of the proposed optimization mechanism.
The main experiments use method-specific generation budgets rather than matching the number of property predictor evaluations or computational budgets. Table S2 shows that AReUReDi requires substantially more time per candidate than several baselines. Consequently, it remains unclear how much of its performance advantage can be attributed to the proposed optimization mechanism rather than greater computational expenditure.
Although some ablations use matched evaluation budgets, the main baseline comparisons do not systematically characterize the trade-off between optimization performance and computational cost. Together with the absence of direct comparisons against simple greedy search strategies, the experiments do not sufficiently isolate the benefits of the proposed search mechanism.
Questions for authors
1. On the necessity and novelty of the search algorithm:
Since the method already evaluates multiple candidate substitutions at each refinement step, why are Barker-balanced proposals and annealed Tchebycheff guidance necessary instead of simpler greedy or random local search strategies? Could the authors compare against greedy weighted-utility maximization and worst-objective-guided local search under the same generator, property predictors, and evaluation budget, reporting both optimization performance and candidate diversity? Such comparisons would help establish the distinctive benefits of the proposed search mechanism.
2. On evaluation metrics and practical applicability:
How do the authors justify the comparability of normalized scores across heterogeneous properties? Would the method rankings remain stable under alternative reasonable normalization schemes? Furthermore, could the authors report the proportion of candidates simultaneously satisfying predefined thresholds for all objectives, and evaluate this joint feasibility rate under different thresholds and preference settings? This would provide more direct evidence that improved property balance translates into practically useful candidates.
6 comments
Weakness 2 and Question 2
Normalized balance metrics may not reflect practical candidate quality, motivating sensitivity analyses of score normalization and evaluation under joint feasibility thresholds.
We appreciate the reviewer's questions on score interpretation and candidate quality. In AReUReDi, score transformations and objective weights jointly define user-specified optimization preferences. For positive rescaling , adjusting the weights as and guidance strength as , where , preserves the proposal distribution and utility acceptance rule under fixed candidate support. Nonlinear transformations encode different preferences and may change method rankings. We therefore evaluate methods under common, explicitly specified scoring conventions without assuming universal biological comparability across properties.
Importantly, our task is continuous, preference-controlled multi-objective optimization, not threshold-constrained optimization. The benchmark specifies no minimum acceptable values or experimentally calibrated feasibility thresholds for the five objectives. Consequently, joint feasibility rate is not a well-defined metric for this task. Introducing arbitrary thresholds would impose additional application-specific constraints and change the optimization problem being evaluated, without establishing biological feasibility. We instead assess predicted candidate quality through complementary metrics, including individual property scores, worst-property performance, aggregate utility, sequence diversity, generator alignment, and Pareto coverage. Our controlled preference experiments further demonstrate that AReUReDi can systematically adjust candidate-level balance and trade-off coverage through user-specified preferences (Table R3). Together, these evaluations directly support the continuous multi-objective design capability that AReUReDi is intended to provide.
Table R3. Controlled preference comparison (Table S32 in the revised manuscript). Each setting returned 108 candidates per target using identical generators, predictors, score transformations, and refinement schedules.
| Target | Preference | Mean Min. ↑ | HV ↑ | IGD+ ↓ |
|---|---|---|---|---|
| 1B8Q | Equal weights | 0.470 | 0.587 | 0.0203 |
| 1B8Q | Dirichlet(1) sweep | 0.384 | 0.578 | 0.0105 |
| PPP5 | Equal weights | 0.587 | 0.676 | 0.0121 |
| PPP5 | Dirichlet(1) sweep | 0.444 | 0.687 | 0.0067 |
Weakness 3
Method-specific evaluation budgets and the absence of direct local-search baselines make it difficult to isolate AReUReDi's algorithmic benefits from additional computation.
Thank you for emphasizing the need for budget-controlled comparisons. Under matched property-predictor query budgets, AReUReDi outperformed NSGA-III, SMS-EMOA, and SPEA2 across all five candidate-quality metrics on both targets, achieving stronger worst-property scores, better within-candidate balance, higher aggregate utility, and greater sequence diversity (Table R4). It also recorded the shortest observed search time, although the shared-GPU execution conditions limit direct runtime comparisons.
As discussed in W1/Q1, preserving the learned peptide sequence prior is central to AReUReDi's refinement strategy, particularly when optimizing imperfect property predictors. Although MOPSO achieved higher optimization-time worst-property scores, AReUReDi maintained greater sequence diversity and achieved the lowest PepReDi3 endpoint cross-entropy among all four evolutionary baselines on both targets, including reductions of 13.2% and 10.9% relative to MOPSO. This confirms that the stronger generator alignment observed against Utility-Greedy also extends to MOPSO under matched query budgets. We further evaluated Utility-Greedy, worst-objective greedy, random gated search, and the ablation under shared local-search conditions, as detailed in W1/Q1. Together, these controlled comparisons establish AReUReDi's contribution beyond additional predictor evaluations: effective multi-objective refinement with substantially stronger preservation of the learned peptide sequence prior.
Table R4. Matched-query external comparisons (Tables S26–S28 in the revised manuscript).
| Target | Method | Mean Min. ↑ | Range ↓ | Dispersion ↓ | Mean Utility ↑ | Hamming Diversity ↑ | Search Time (min) ↓ | PepReDi3 CE ↓ |
|---|---|---|---|---|---|---|---|---|
| 1B8Q | AReUReDi | 0.4735 ± 0.0163 | 0.4775 ± 0.0112 | 0.1807 ± 0.0052 | 0.7792 ± 0.0101 | 0.8618 ± 0.0114 | 3.9 ± 0.2 | 2.5786 ± 0.0196 |
| 1B8Q | MOPSO | 0.6727 ± 0.0227 | 0.2792 ± 0.0266 | 0.1033 ± 0.0108 | 0.8165 ± 0.0150 | 0.6179 ± 0.0750 | 8.6 ± 1.3 | 2.9712 ± 0.1251 |
| 1B8Q | NSGA-III | 0.4140 ± 0.0159 | 0.5310 ± 0.0132 | 0.1955 ± 0.0043 | 0.7326 ± 0.0092 | 0.6083 ± 0.0511 | 8.0 ± 0.6 | 2.9462 ± 0.0635 |
| 1B8Q | SMS-EMOA | 0.2913 ± 0.0262 | 0.6417 ± 0.0246 | 0.2353 ± 0.0085 | 0.6801 ± 0.0077 | 0.6267 ± 0.0699 | 12.5 ± 1.9 | 3.0956 ± 0.0805 |
| 1B8Q | SPEA2 | 0.3297 ± 0.0159 | 0.6001 ± 0.0113 | 0.2231 ± 0.0052 | 0.6535 ± 0.0092 | 0.7179 ± 0.0745 | 7.9 ± 2.2 | 3.0554 ± 0.0669 |
| PPP5 | AReUReDi | 0.5927 ± 0.0191 | 0.3812 ± 0.0154 | 0.1389 ± 0.0065 | 0.8351 ± 0.0076 | 0.8592 ± 0.0096 | 16.7 ± 0.2 | 2.6093 ± 0.0179 |
| PPP5 | MOPSO | 0.6979 ± 0.0141 | 0.2611 ± 0.0121 | 0.0961 ± 0.0044 | 0.8296 ± 0.0128 | 0.7859 ± 0.0303 | 37.3 ± 3.4 | 2.9292 ± 0.0363 |
| PPP5 | NSGA-III | 0.5247 ± 0.0836 | 0.4473 ± 0.0775 | 0.1683 ± 0.0340 | 0.7942 ± 0.0545 | 0.4007 ± 0.0137 | 35.1 ± 5.6 | 2.8007 ± 0.0702 |
| PPP5 | SMS-EMOA | 0.5180 ± 0.0671 | 0.4586 ± 0.0640 | 0.1689 ± 0.0210 | 0.8019 ± 0.0293 | 0.3728 ± 0.0410 | 44.5 ± 1.2 | 2.7987 ± 0.1822 |
| PPP5 | SPEA2 | 0.3386 ± 0.0154 | 0.6115 ± 0.0217 | 0.2302 ± 0.0105 | 0.6629 ± 0.0173 | 0.5864 ± 0.0708 | 36.4 ± 5.6 | 2.9184 ± 0.2166 |
We hope the new greedy and random-search controls, generator-prior and cross-evaluator analyses, and matched-budget comparisons substantively address your concerns about algorithmic necessity, candidate quality, and computational cost. Together, these results strengthen the evidence for AReUReDi's distinctive contribution to multi-objective peptide design. We would be grateful if you would reconsider your score and confidence in the submission in light of these findings.
We sincerely thank the reviewer for the detailed and constructive feedback, particularly for recognizing the importance of candidate-level multi-objective optimization and the benefits of refinement without generator retraining. Your questions regarding methodological novelty, practical candidate quality, and computational fairness motivated several additional experiments, which we present below.
Weakness 1 and Question 1
Thank you for challenging the necessity of our refinement algorithm. A central challenge in multi-objective peptide design is that maximizing predicted properties does not necessarily preserve biologically meaningful sequence patterns. Property predictors are imperfect surrogates, and aggressive optimization can favor high-scoring sequences poorly represented by peptide training data. We therefore designed AReUReDi to jointly address three requirements: improving limiting properties, retaining the learned peptide sequence prior, and preserving aggregate utility. This separation of proposal guidance and acceptance establishes a distinct optimization principle beyond preference-guided generation in MOG-DFM and multi-objective tree search in PepTune.
The stochastic proposal has an exact KL-regularized variational interpretation:
\Bigl\lbrace \mathbb E_{y\sim q}[\log\sigma(\eta\Delta S_y)] -D_{\mathrm{KL}}(q\Vert b_C) \Bigr\rbrace,$$ where $b_C$ denotes the filtered generator distribution and $\Delta S_y$ the bottleneck-score change. This construction balances property guidance against deviation from the generator's local probabilities and improves the expected proposed bottleneck-score change relative to the unweighted proposal. The acceptance rule independently guarantees nondecreasing weighted utility. **We deliberately use this non-equilibrium refinement rule because exact Metropolis–Hastings sampling targets distributional invariance, requires sequence-density ratios, and generally permits utility-decreasing transitions.** Its equilibrium guarantees therefore address a different objective from our finite-budget refinement task. To test the contribution of this design, we compared AReUReDi with Utility-Greedy, worst-objective greedy, random gated search, and the $\eta=0$ ablation under controlled conditions (Table R1). Bottleneck reweighting improved both endpoint utility and worst-property scores relative to $\eta=0$ on both targets, establishing a contribution beyond generator sampling and monotone acceptance alone. **More importantly, the experiments reveal the practical value of preserving the generator prior.** Compared with Utility-Greedy, AReUReDi achieved 9.4% and 9.1% lower PepReDi3 endpoint cross-entropy, indicating stronger agreement with peptide sequence patterns learned by the pretrained generator. Under the separate PeptiVerse predictor panel, AReUReDi also achieved higher worst-property scores on both targets, retaining its advantage across 82/100 and 97/100 predictor combinations (Table R2). These results support generator-informed stochastic refinement as a means of balancing surrogate optimization with learned sequence preferences, with stronger performance under alternative evaluators. Together, these theoretical and empirical results establish the contribution of AReUReDi: a generator-regularized stochastic refinement mechanism that improves limiting properties while preserving aggregate utility, with measurable advantages in learned-prior alignment and cross-evaluator candidate quality beyond direct surrogate maximization. **Table R1. Controlled local-search comparisons (Table S29 in the revised manuscript).** |Method|1B8Q Utility ↑|1B8Q Hamming Diversity ↑|PPP5 Utility ↑|PPP5 Hamming Diversity ↑| |-|-|-|-|-| |AReUReDi|0.7792|0.8618|0.8351|0.8592| |No bottleneck reweighting (η=0)|0.7657|0.8709|0.8323|0.8568| |Worst-objective greedy + utility gate|0.7445|0.8861|0.7812|**0.9136**| |Random proposals + utility gate|0.7726|**0.8916**|0.8147|0.9116| |Utility-Greedy|**0.8214**|0.8570|**0.8666**|0.8891| **Table R2. Generator alignment and independent-predictor evaluation (Table S30 in the revised manuscript).** |Target|Method|Search-Time Mean Min. ↑|Search-Time Utility ↑|Hamming Diversity ↑|PepReDi3 CE ↓|PeptiVerse-Panel Mean Min. ↑| |-|-|-|-|-|-|-| |1B8Q|AReUReDi|0.4735|0.7792|**0.8618**|**2.5786**|**0.4663**| |1B8Q|Utility-Greedy|**0.5552**|**0.8214**|0.8570|2.8453|0.4369| |PPP5|AReUReDi|0.5927|0.8351|0.8592|**2.6093**|**0.4109**| |PPP5|Utility-Greedy|**0.6481**|**0.8666**|**0.8891**|2.8707|0.3828|