- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper studies how to discover multiple high-reward molecules under a limited evaluation budget. At each round, GDA generates and screens offspring for every molecule in an evaluated parent memory. It scores each eligible parent using the mean and sample standard deviation of surrogate-predicted rewards across its surviving offspring. Acquisition and structural coverage select parents; a separate combination of predicted reward, ensemble spread, and novelty selects one child per chosen parent.
Critical strengths
S1. The paper addresses a meaningful problem: discovering multiple promising molecules under a limited budget of expensive evaluations. This objective reflects practical discovery campaigns, where several candidates are needed for downstream screening and validation. S2. The paper is clearly presented and well organized. Its progression from motivation and method to experiments makes the proposed approach and supporting results easy to follow.
Critical weaknesses
W1. The paper's technical novelty is not sufficiently clear. PopVar predicts simulated offspring performance [1], and Osthushenrich et al. combine offspring means and standard deviations to rank crosses [2]. The authors should explain how GDA extends these breeding principles, which difficulties in molecular search require new designs, and why its score is preferable to simpler alternatives. W2. The external baseline comparison does not adequately cover recent methods. The six comparison entries include only three external algorithms, Graph GA (2019), REINVENT (2017), and Augmented Memory (2024), alongside two internal controls and Random. Comparisons with suitable recent methods such as GenMol, Saturn, or SEGO are needed to establish GDA's competitiveness[3-5]. References [1] PopVar: A Genome-Wide Procedure for Predicting Genetic Variance and Correlated Response in Biparental Breeding Populations. [2] Genomic selection of crossing partners on basis of the expected mean and variance of their derived lines. [3] GenMol: A Drug Discovery Generalist with Discrete Diffusion. [4] Sample-efficient generative molecular design using memory manipulation. [5] Sample Efficient Generative Optimization for Molecular Design.
Questions for authors
Q1. What is new in GDA compared with the progeny-selection principles in [1,2], and what difficulty in molecular search does it address? Q2. Can you justify the baseline selection and compare GDA with suitable recent methods, prioritizing Saturn and one of GenMol or SEGO where feasible?
8 comments
Rebuttal by Authors
2. Is the score preferable to simpler alternatives?
We have tested parent selection by the maximum predicted offspring reward and by the mean of the top four predictions. Both retain GDA's generation, screening, child selection, coverage, and memory-update rules. The following are distinct top-1% hits, mean ± standard error across five matched seeds:
| Task | GDA | Offspring max | Top-4 mean |
|---|---|---|---|
| F2 | 379.0 ± 18.6 | 303.6 ± 59.5 | 316.4 ± 33.3 |
| JAK2 | 186.6 ± 28.9 | 204.2 ± 28.8 | 183.2 ± 34.3 |
| PPAR | 403.6 ± 32.1 | 376.6 ± 30.7 | 325.2 ± 10.9 |
| FA7 | 461.4 ± 39.0 | 400.4 ± 66.2 | 436.8 ± 30.2 |
| BRAF | 495.0 ± 24.5 | 529.6 ± 23.6 | 500.8 ± 31.7 |
| PARP1 | 373.2 ± 44.6 | 382.8 ± 38.9 | 423.4 ± 41.9 |
GDA has the highest mean of these three rules on F2, PPAR, and FA7. The alternatives are competitive on the remaining tasks, so we present GDA as an effective choice within this framework rather than a uniformly superior functional form. The paired gain over Top-4 mean on PPAR is 78.4 ± 24.4 hits, positive in all five seeds.
The more direct test of the dispersion component is with all other rules retained. Keeping the bonus yields paired gains of 127.8 ± 31.7 on F2, 119.6 ± 40.3 on PPAR, and 106.0 ± 34.5 on FA7, each positive in all five seeds. The other three tasks have smaller average gains with greater seed uncertainty. The revised manuscript now shows the disagreement ablation for all six tasks. This evidence supports the usefulness of offspring dispersion in several molecular search settings while preserving the distinction between a design motivation and an empirical comparison.
Rebuttal by Authors
3. Recent external baselines: Saturn, GenMol, and GEAM.
Following the reviewer's suggested priority, we have completed Saturn and GenMol on all six tasks with five seeds per method. We also evaluated the GEAM method and the sequential-restart control on all six tasks.
All methods receive the same 512 initial labels and a cap of 800 online evaluations. Below, OB@100 is the mean cumulative number of calls needed to obtain 100 distinct top-1% hits, measured at batch completion over successful seeds. Parentheses give success counts below five. A dash means no seed reaches the count.
| Method | F2 hits | JAK2 hits | PPAR hits | OB@100: F2 / JAK2 / PPAR |
|---|---|---|---|---|
| GDA | 379.0 ± 18.6 | 186.6 ± 28.9 | 403.6 ± 32.1 | 810 / 1050 / 807 |
| Saturn | 292.2 ± 23.8 | 225.2 ± 18.8 | 351.2 ± 32.8 | 1014 / 1072 / 942 |
| GenMol | 66.4 ± 7.0 | 58.0 ± 10.4 | 91.6 ± 8.1 | — / — / 1256 (2/5) |
| GEAM method | 60.0 ± 5.0 | 43.4 ± 6.1 | 62.2 ± 12.2 | — / — / — |
| Augmented Memory | 223.8 ± 43.8 | 142.6 ± 18.5 | 319.0 ± 13.9 | 1118 / 1194 (4/5) / 987 |
| REINVENT | 53.8 ± 7.5 | 32.6 ± 3.0 | 67.8 ± 14.2 | — / — / 1280 (1/5) |
| Graph GA | 111.0 ± 21.8 | 85.8 ± 7.0 | 188.2 ± 17.1 | 1172 (2/5) / 1304 (2/5) / 1054 |
GDA reaches 100 hits with lower mean oracle burden than every external baseline in this table on all three tasks, and reaches the count in every seed. It also has the highest final mean yield on F2 and PPAR. On JAK2, it reaches 100 sooner than Saturn, while Saturn achieves a higher final yield. This distinction is useful for campaigns with different stopping requirements. Both results are reported in the revised manuscript.
The GEAM-target comparison shows the same early-discovery strength. On FA7/BRAF/PARP1, GDA reaches 100 hits in 751/721/806 cumulative calls, versus Saturn's 861/814/875, with all seeds successful. Final mean yields are 461.4/495.0/373.2 for GDA and 368.8/511.2/440.8 for Saturn.
The newly completed GEAM-method and GenMol results on the GEAM targets are:
| Method | FA7 hits | BRAF hits | PARP1 hits | OB@100: FA7 / BRAF / PARP1 |
|---|---|---|---|---|
| GDA | 461.4 ± 39.0 | 495.0 ± 24.5 | 373.2 ± 44.6 | 751 / 721 / 806 |
| GEAM method | 2.2 ± 0.9 | 8.6 ± 1.3 | 4.8 ± 1.7 | — / — / — |
| GenMol | 51.8 ± 5.7 | 97.2 ± 9.6 | 70.8 ± 5.8 | — / 1240 (3/5) / — |
Hit yields are means ± standard errors across five seeds. GDA has higher mean hit yield than both added baselines on every GEAM target and reaches 100 hits in all five seeds. GenMol reaches 100 hits on BRAF in three seeds, while the GEAM method does not reach 100 on any target. These comparisons evaluate the methods under the stated initialization and evaluation protocols.
Implementation and comparison scope. Saturn uses our implementation of its Mamba-based replay and memory-manipulation procedure. GEAM and GenMol use their released implementations adapted to our oracle and budget. GEAM's fragment scorer and initial vocabulary use the shared 512 labels. GenMol uses its pretrained model with an initial fragment vocabulary derived from those labels and a warmup scaled to the 800-call budget. We have documented these choices in the appendix. This comparison uses the same initial molecules and the stated evaluation protocols.
Finally, the recorded budget profiles help explain the value of oracle burden. At 200 online calls, GDA obtains 55.6/23.6/58.0 hits on F2/JAK2/PPAR, compared with Saturn's 14.6/13.4/23.2. The lead narrows or changes by the endpoint on some tasks. We now report oracle burden in the main results, retain final hit yield, and include the budget profiles in the appendix. The profiles describe completed-batch prefixes of the recorded searches. They do not establish a causal explanation for the learning dynamics.
We have updated the related-work discussion, contribution statements, baseline descriptions, and results accordingly. These new experimental results clearly demonstrate that GDA makes offspring-distribution-based parent acquisition operational for screened molecular search and provides strong early discovery performance under the tested budgets, with controlled evidence showing where its disagreement term contributes.
Rebuttal by Authors
We thank the reviewer for recognizing the practical importance of discovering multiple promising molecules within a limited evaluation budget, and for finding the paper's organization and progression clear. We particularly appreciate the breeding references and the specific baseline suggestions. They help us explain the contribution more precisely and test its competitiveness against recent methods. To help the reviewer locate the changes, we have highlighted new and revised text in blue in the updated manuscript.
1. Relationship to PopVar and offspring-based selection in breeding.
We thank the reviewer for highlighting this relevant connection. PopVar predicts progeny performance through simulation and genomic prediction, while Osthushenrich et al. derive progeny means and variances to guide the selection of crossing partners. These studies establish a connection between offspring distributions and parental value.
GDA develops a parent-level acquisition framework for molecular discovery that connects this distributional information to the allocation of expensive oracle evaluations. Its contribution lies in coordinating parent selection, child acquisition, and adaptive memory using the offspring that survive molecular screening. The central decision is which parents should supply the limited number of molecules evaluated in each round, and how their observed outcomes should guide subsequent search. Three aspects of this setting shape the method:
The methodological contribution is the joint design of these decisions within a closed-loop molecular search procedure. GDA scores parents through their screened offspring distributions, selects individual children for evaluation, and uses the resulting feedback to update both predictions and the parent memory. The standard expected-maximum bound motivates the rollout-dependent exploration scaling. Controlled ablations and comparisons with maximum and top-k parent scores assess the empirical value of the resulting acquisition rule. We have sharpened the related-work discussion and contribution statement to make this connection to breeding research and GDA's specific algorithmic contribution clear.