- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper introduces EW-SFT, which performs goal-directed molecular optimization through reward-guided elite selection and native-loss fine-tuning. The method is applied to SAFE-GPT, GenMol, and InVirtuoGen, and evaluated on de novo, motif-extension, and linker-design tasks.
Critical strengths
The proposed method is conceptually simple and avoids some complex machinery. The implementation and experimental settings are described in detail. The experimental scope is relatively broad.
Critical weaknesses
-
The methodological novelty may be limited. It seems the method uses “elite+binary”. Under this setting, the method may just select top k molecules based on the reward and then perform standard fine-tuning. In other words, the reward may only determine whether the molecule is selected, and is not involved in weighting the gradient update. This design appears to be the core mechanism of previous hill-climbing methods. Also, in terms of implementation details, the proposed method appears to be similar to GEGL, which uses genetic search, a max-reward queue, and unweighted imitation as well. Then, the key difference of this work from previous studies would be using each architecture’s native pretraining loss and extending the approach to different architectures. It is unclear if these could be considered as sufficient methodological novelty. Additionally, the native pretraining loss may have different meanings in different architectures. For example, in GenMol and InVirtuoGen, the native pretraining loss may not be the exact negative log-likelihood of generated molecules. Then, optimizing or reducing these native pretraining losses may not necessarily imply a higher probability of generating high-reward molecules as intended. Even though the native pretraining loss could be reused, applying the full pipeline to different architectures may not be easy, which may still need lots of architecture-specific designs.
-
The experimental evidence may not fully support the advantage or effectiveness of the proposed method. The ablation results may suggest that native-loss fine-tuning is not as effective as expected. When isolated from genetic search, native-loss fine-tuning seems to fail to improve the generator and even decrease the performance in GenMol and InVirtuoGen. It is likely that the major improvement of the method is from the external genetic search rather than the proposed native-loss update. Also, genetic search may already produce better training samples based on the reward and the contribution of elite selection may be unclear. There is no ablation of “G+batch+binary” to support the usefulness of elite selection. What’s more, the reported advantage of the proposed method may be due to the additional oracle calls. Under matched oracle-call budgets, the performance is close to or even worse than baselines.
Questions for authors
-
What are the substantial methodological contributions of this study?
-
Could the authors provide more convincing evidence to support the effectiveness, necessity, or advantage of the proposed method?
2 comments
I appreciate the authors' efforts in the rebuttal. It somewhat improves the soundness. However, overall, the key concerns in my initial review seem not to have been fully addressed.
-
The core method or algorithm seems to be very similar to existing ones.
-
Stronger theoretical justification is needed for the use of the native loss, rather than mainly relying on empirical results. This concerns the theoretical correctness.
-
On GenMol, the p-value is 0.057, which seems not to be statistically significant. Does this mean elite selection may not be necessary for some backbones?
-
Its generalizability to other architectures may still not be clear. But this is not the current major concern.
Given this, I will keep my original assessment for now.
Response to Reviewer jUtg
The additional experiments and controls warrant reassessing soundness.
1. Methodological contribution and native-loss interpretation
Our method is designed to investigate a shared reward-guided native-loss update across architectures, learning objectives, and generative designs. To avoid deriving policies for each generation procedure, we learn from completed, scored molecules, separating proposal source, reward-based selection, and within-set emphasis. Ablations identify search + elite selection + binary learning as the preferred shared configuration. Its simplicity is an outcome of this investigation.
GEGL's unweighted likelihood refitting is a working special case at the learning-principle level. Structural similarity of the final best variant does not make our original formulation or findings a transplantation of GEGL. Besides, our generators perform conditional completion/regeneration as genetic operations, while global elite selection differs from its separate apprentice/expert queues. Within GEGL itself, using EW-SFT significantly improves mean AUC Top-10 from 0.712 to 0.736 (p=0.0025) over native dual-queue sampling at 10k calls. The design difference matters under a limited budget (see implementation details and table in Reviewer Exm6, Response 1: seven-task controlled comparison).
Meaning of the native loss: Sections 2 and 3.2 distinguish NELBO from exact NLL. Reducing NELBO lowers an upper bound on NLL but does not guarantee increased exact likelihood or expected reward. Our claim is empirical: native-loss updating on reward-guided genetic samples improves optimization outcomes.
2. Updating contributes beyond genetic search
SFT-only removes genetic proposals and therefore changes the training-data source. Its weak performance shows the importance of those proposals. The GA-only comparison isolates the contribution of model updating while retaining the genetic-operator design.
Paired comparisons across 2 references, 3 tasks, and 3 seeds give:
All three backbones show significant mean gains. These controls directly establish gains from learning beyond genetic search alone.
3. Requested G+batch+binary control
Holding the genetic-operator design and binary weighting fixed, the added control gives:
Elite selection improves the mean on both backbones, significantly for SAFE-GPT. This directly tests selection beyond training on genetically generated batches. Together with the weighting ablations, it supports elite+binary as an effective configuration without continuous reward weighting, as we already mentioned in the manuscript "the reward signal needs to enter somewhere".
4. Oracle calls and effectiveness
We disagree with the suggestion that EW-SFT's improvement is due to additional oracle calls. Both methods receive the same 20k-call budget and the same novelty-based stopping rule. The native optimizers trigger this criterion because their search fails to maintain sufficient novelty, whereas EW-SFT continues generating previously unseen molecules. This is a difference in optimization behavior, not an unfair allocation of oracle calls.
Table 10 additionally reports the matched-call comparison, although truncating EW-SFT at another optimizer's stopping point imposes a termination condition that EW-SFT itself did not trigger. Even under this comparison, EW-SFT achieves higher Top-1k means in 13 of 16 cells and positive average gains for all three backbones.
EW-SFT continues discovering high-scoring molecules after native stopping, truncation excludes this demonstrated benefit (Reviewer Exm6, Response 2: counts before/after cutoff).
The primary evaluation asks which method finds better molecules under the same maximum budget and stopping rules. The ability to continue discovering high-scoring molecules is part of that evaluation, not a confounding factor that should be removed. PMO complements this evidence with competitive performance across broader objectives using a simpler update (see Reviewer Exm6, Response 2).
In 3D similarity tasks, among runs meeting each criterion, EW-SFT reaches GA-only's final Top-1k mean or exceeds its best-ever score using median 62% or 32% of paired GA-only actual calls (Reviewer YEWo, Response 3).
On seven non-similarity PMO oracles (three seeds, exactly 10k calls, no early stopping), mean AUC Top-10 rises from 0.463 to 0.732 for SAFE-GPT and 0.902 to 0.911 for GenMol (Reviewer Exm6, Response 3). All seven SAFE-GPT means improve, with less runtime (Reviewer YEWo, Response 3).
We ask the reviewer to reassess soundness and effectiveness using these supplementary results.