- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes PEGASUS, a query-efficient inference-time optimizer for multi-objective biomolecular sequence design with frozen discrete flow models. The method combines future observability, implemented through objective-independent finite-time Koopman transport and an online task-specific readout, with multiscale Hamming-space actions and Pareto Decision Observability (PDO). PDO selectively acquires exact objective evaluations only when unresolved uncertainty may change the action decision. The paper also derives a query bound for PDO under an exact decision-linear response model.
Experiments on six-objective peptide design and three-objective DNA design show that PEGASUS achieves competitive or better Pareto quality with substantially fewer oracle queries than several generative and optimization baselines. The paper also includes component ablations, generator substitutions, synthetic validation of the PDO theory, and structural analyses.
Critical strengths
-
PEGASUS shows strong query-efficiency. It achieves Pareto quality comparable to or better than strong discrete generative baselines while using dramatically fewer unique objective evaluations. The advantage is especially clear for the longer peptide setting, where PEGASUS achieves better hypervolume with roughly two orders of magnitude fewer queries. This directly supports the main motivation of the paper.
-
The empirical evaluation is thorough. The paper includes useful component ablations, query accounting, generator substitutions, peptide and DNA experiments, multiscale-action analyses, and synthetic experiments validating the PDO bound in the exact-linear regime. The experiments are generally careful about distinguishing theoretical guarantees from empirical behavior.
Critical weaknesses
-
The role of the Koopman formulation is not fully convincing. Table S12 shows that a dimension-matched generic finite-time linear observer performs better than the proposed Koopman observer on several downstream metrics, especially for L=40, while using similar query counts. This suggests that the main benefit may come from the broader idea of future observability rather than from the Koopman realization itself. The current emphasis on Koopman transport therefore seems somewhat stronger than what the experiments support.
-
The strongest query-efficiency comparison is not fully budget-matched. MOG-DFM and AReUReDi operate at much larger native query budgets, so the “up to 99× fewer queries” result does not directly establish that PEGASUS is better at the same oracle budget. A quality-versus-query comparison or budget-matched versions of the strongest baselines would make the central claim more convincing.
Questions for authors
-
Table S12 shows that a generic dimension-matched finite-time linear observer can outperform the Koopman observer, especially for L=40. What practical advantage justifies treating Koopman transport as a central methodological contribution rather than one possible implementation of future observability?
-
Can the authors provide budget-matched results or quality-versus-query curves for MOG-DFM and AReUReDi at query budgets comparable to PEGASUS?
-
The practical PDO implementation uses approximate response models and a query cap, while the theorem assumes exact decision-linear responses. To what extent do the authors believe the intrinsic-dimension argument explains the empirical query savings observed in PEGASUS?
5 comments
W2 + Q2. Comparable-query single-candidate comparison
The query-efficiency gains over MOG-DFM and AReUReDi are not established under matched budgets, requiring budget-matched or quality-versus-query tests.
We thank the reviewer for this valuable suggestion. PEGASUS generates a complete library of 100 terminal peptides using approximately the same number of oracle queries that MOG-DFM and AReUReDi require to produce their first completed peptide. We therefore compared PEGASUS's highest-utility terminal peptide with the first completed peptide from each baseline, preserving their native generation procedures (Table W2).
PEGASUS achieved substantially higher Top-1 utility than both baselines at both sequence lengths, with a particularly pronounced advantage at L = 40, where PEGASUS also attained the highest mean scores across all six objectives. These results establish PEGASUS's strong best-available-candidate quality at comparable oracle-query expenditures, with candidate-selection opportunities reflecting the number of peptides each method could complete at that cost.
Together with our original fixed-100 comparison demonstrating comparable or superior Pareto quality with up to 99× fewer queries, these results establish PEGASUS's strong quality-efficiency advantage at both individual-candidate and terminal-library levels.
Table W2: Approximately budget-matched Top-1 peptide optimization (Table S37 in the revised manuscript).
| Length | Method | Non-Hemolysis ↑ | Non-Fouling ↑ | Solubility ↑ | Permeability ↑ | Half-Life ↑ | Affinity ↑ | Top-1 Utility ↑ | Queries ↓ |
|---|---|---|---|---|---|---|---|---|---|
| L = 12 | PEGASUS | 0.9887 ± 0.0109 | 0.8569 ± 0.0425 | 0.9964 ± 0.0087 | 0.8161 ± 0.0390 | 0.9177 ± 0.0664 | 0.8014 ± 0.0287 | −0.0343 ± 0.0049 | 1303.8 ± 67.6 |
| MOG-DFM | 0.9728 ± 0.0126 | 0.9654 ± 0.0282 | 1.0000 ± 0.0000 | 0.9517 ± 0.0309 | 0.6016 ± 0.0572 | 0.5848 ± 0.0545 | −0.0733 ± 0.0079 | 1045.2 ± 205.2 | |
| AReUReDi | 0.9756 ± 0.0137 | 0.9417 ± 0.0396 | 0.9995 ± 0.0007 | 0.9498 ± 0.0284 | 0.6705 ± 0.1599 | 0.6341 ± 0.0433 | −0.0743 ± 0.0152 | 1061.2 ± 192.9 | |
| L = 40 | PEGASUS | 0.9320 ± 0.0482 | 0.7990 ± 0.0432 | 0.9119 ± 0.0832 | 0.7470 ± 0.0471 | 0.7869 ± 0.0536 | 0.7452 ± 0.0419 | −0.0469 ± 0.0052 | 1568.2 ± 118.7 |
| MOG-DFM | 0.9168 ± 0.0387 | 0.1479 ± 0.2196 | 0.8952 ± 0.2387 | 0.3806 ± 0.2503 | 0.7320 ± 0.1051 | 0.6834 ± 0.0925 | −0.1540 ± 0.0263 | 1509.2 ± 89.7 | |
| AReUReDi | 0.8473 ± 0.0667 | 0.2463 ± 0.3346 | 0.9110 ± 0.0770 | 0.5828 ± 0.1006 | 0.6358 ± 0.0970 | 0.6412 ± 0.0816 | −0.1452 ± 0.0331 | 1736.3 ± 83.8 |
Q3. PDO intrinsic dimension, query caps, and empirical stopping
To what extent does the exact-linear intrinsic-dimension theorem explain PDO's query savings when its implementation uses approximate response models and a query cap?
Thank you for this insightful question. The theorem identifies a fundamental source of query savings: under exact decision-linear responses, query complexity depends on unresolved decision-relevant directions rather than the number of candidate actions. Practical PDO approximates this principle through committee-based decision resolution. To assess whether its observed efficiency primarily arises from this mechanism or hard query-cap truncation, we conducted additional paired capped and uncapped replays on 96 frozen Hamming-1 decision states (Table Q3).
Over 95% of decisions terminated through committee-based stopping before reaching the query cap. Removing the cap preserved the selected action in 94/96 cases, with median uncapped query demand remaining at just one. Furthermore, our existing candidate-set scaling experiment (Table S20) showed that increasing the Hamming-1 candidate pool eightfold, from 64 to 512, increased mean fresh queries only from 2.52 to 3.38. PDO also improved accepted fine-stage gain under matched query allowances (Table S19).
These results show that practical PDO's sparse querying is primarily driven by decision-based stopping, with the query cap serving as a safeguard. The intrinsic-dimension theorem characterizes this principle under exact-linear assumptions, while our empirical results establish its practical relevance without assuming an exact dimension-based scaling law for the approximate implementation.
Table Q3: PDO Query-Cap Sensitivity on 96 Frozen Decision States (Table S38 in the revised manuscript).
| Replay Setting | Committee-Resolved Stops ↑ | Mean Queries (Capped / Uncapped) ↓ | Uncapped Median Queries ↓ | Decisions Changed ↓ |
|---|---|---|---|---|
| Production Prescreen | 92/96 (95.8%) | 1.22 / 1.72 | 1 | 2/96 |
| Full Hamming-1 | 93/96 (96.9%) | 1.20 / 2.20 | 1 | 2/96 |
We hope that our new task-projected Koopman evaluation, comparable-budget comparison with MOG-DFM and AReUReDi, and PDO query-cap sensitivity experiments address the reviewer's concerns and further substantiate PEGASUS's contributions. We welcome any further questions during the discussion period and would greatly appreciate your support for acceptance!
Follow-up on Our Rebuttal
Dear Reviewer XZ1g,
Thank you again for your detailed review and helpful suggestions.
Our additional experiments directly address your three questions. First, the new task-projected evaluation demonstrated Koopman's advantage over a generic linear observer, reducing prediction error by 32.6% and 15.8% at L = 12 and L = 40, respectively (Table S35). Second, at approximately comparable oracle-query expenditures, PEGASUS achieved substantially higher Top-1 utility than both MOG-DFM and AReUReDi at both sequence lengths, strengthening our original quality-efficiency findings (Table S37). Third, our PDO sensitivity experiments confirmed that over 95% of decisions terminate before reaching the query cap, with the selected action unchanged in 94/96 cases after removing the cap. This supports decision-based stopping as the primary source of practical query savings (Table S38).
We hope these new results address your questions and further support PEGASUS's contributions. We look forward to hearing your thoughts and would be happy to address any remaining concerns.
The Authors
We sincerely thank the reviewer for their thorough and constructive evaluation, particularly for recognizing PEGASUS's strong query efficiency, extensive experimental validation, and careful distinction between theoretical guarantees and empirical behavior. We appreciate the insightful questions regarding Koopman transport, query-budget fairness, and PDO's practical efficiency, which we address with additional experiments and analyses below.
W1 + Q1. Koopman transport versus generic linear observers
Thank you for this important question regarding the specific contribution of Koopman transport. Koopman provides an objective-independent mechanism for transporting future objective-relevant information through the frozen generative dynamics. Its finite-time operators are calibrated without downstream objective labels, while task-specific readouts are updated using sparse exact evaluations. This separation enables prospective terminal-quality estimation directly from intermediate states without repeated rollout-based scoring.
To directly assess Koopman's advantage over a generic linear observer, we conducted an additional held-out task-projected transport evaluation, measuring the accuracy of future objective-relevant information rather than full feature reconstruction. As shown in Table W1, Koopman reduced task-projected error by 32.6% at L = 12 and 15.8% at L = 40 relative to the dimension-matched generic linear observer, with positive paired improvements whose 95% confidence intervals exclude zero. Without finite-time transport, errors increased substantially to 0.663 and 0.816, respectively.
While Table S12 evaluates downstream optimization involving multiple interacting decision mechanisms, the new experiment directly isolates the predictive contribution of Koopman transport. These results establish a clear, quantitative advantage in preserving terminal-objective-relevant information, supporting Koopman as a principled and empirically validated realization of PEGASUS's Future Observability mechanism.
Table W1: Task-Projected Transport Error of Future Observers (Table S35 in the revised manuscript).