- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes MOLT, a self-evolving agentic system for lead optimization. The proposed method converts evaluated molecular transitions into reusable chemical transformations with property evidence. The context-conditioned action policy ranks applicable transformations, and the agent's decisions are used to further update the action policy. Based on the top candidates, an LLM controller plans across retained search branches. The method is evaluated on five constrained lead-optimization tasks, with planning ablations, case studies, and an out-of-distribution ChEMBL generalization experiment.
Critical strengths
-
The paper is easy to follow. The challenges in learning from molecular optimization experience are clearly illustrated and motivate the design of MOLT.
-
The proposed method achieves substantial improvements over the agentic baselines on the primary five constrained lead-optimization tasks. The planning ablation also supports the benefit of retaining alternative search branches over other settings. The evaluation on ChEMBL leads shows the approach's ability to transfer beyond the main task.
Critical weaknesses
-
The contribution of the context-conditioned action policy and its self-evolving updates is not fully ablated. It is unclear whether the self-evolving updates provide substantial improvements over a fixed chemical knowledge base and a frozen action policy, or whether most of the gains come from the learned transformation ranking and retained-branch planning.
-
Some important implementation details are missing or unclear, like the exact LLM for MOLT planning, the setting of feedforward network for action policy, the prompts, and search budget... The main performance tables do not report variability across independent runs, which makes difficult to assess the robustness of the reported improvements. Since the framework relies on an LLM controller, it is also unclear whether the observed performance generalizes across different LLM backbones or depends on the specific controller used in the experiments.
Questions for authors
-
Have the authors considered an ablation to compare the action-policy-selected Top-5 transformation against randomly selecting five applicable transformations, or selecting them using historical rule statistics, or selecting by LLM controller?
-
According to the second weakness, can the authors provide the exact LLM model and its settings, action policy neural network settings, prompts, and optimization budget? If the main results were obtained from multiple runs, reporting mean and standard deviation across seeds would help establish their stability.
-
Case study 1 shows how accumulated experience introduces and strengthens a useful but late transformation. However, can the same mechanism reinforce suboptimal actions, like the model strengthening its belief in local-optima evidence? It would be interesting to examine failure cases where the agent favors certain transformations while overlooking potentially better frontier branches, and whether the retained-branch mechanism successfully redirects the search toward other feasible paths.
-
A minor presentation comment, the caption of Table 2 should be placed above the table.
W1. Do the self-evolving updates improve over a fixed knowledge bank and frozen action policy, or do most gains come from transformation ranking and retained-branch planning?
Response:
Thank you for your question. The results show that transformation ranking, retained-branch planning, and accumulated knowledge each contribute at a different stage of MOLT.
With the same knowledge bank, the context-conditioned policy improves Hit@5 from 53.6% with historical rule statistics to 70.7% (Fig. 3c). With the same bank and action policy, retained-branch planning improves SR from 58.9% for a single trajectory to 69.6%, while later success increases from 32.4% to 48.9% (Table 2). We further evaluated how performance changes as experience accumulates. With the planner and search budget fixed, increasing exploratory experience from 256 to 32K transitions raises end-to-end SR from 19.5% to 54.4%:
The experience-growth curve is reported in Appendix A.6 (Fig. 5) of the revised manuscript.
W2/Q2. What are the implementation settings, and how stable are the results across seeds and controller backbones?
Response:
Thank you for asking for these implementation details and robustness checks. The main experiments use Qwen2.5-7B-Instruct without fine-tuning. At each step, the prompt shows the current frontier molecules with their depth, SMILES, similarity to the starting lead, and RDKit descriptors, and asks the controller which branch to expand. The search uses the top five transformations per expanded node, a maximum depth of 10, and a budget of 10 committed outputs. It stops when a feasible molecule is found or the output budget is exhausted. Unselected branches remain available for later backtracking. BBBP, HIA, and Mutagenicity are evaluated only for committed outputs, averaging 4.6 ADMET evaluations per query; unselected branches do not incur these evaluations. The complete search takes 3.4 seconds per query on a single NVIDIA A5000 GPU, including an average of 4.6 controller calls. The controller settings, search budget, computational profile, and representative prompt are reported in Appendix A.13 and Table 12.
To directly assess variability and controller dependence, we additionally ran a robustness study on the same fixed set of 500 queries, with 100 queries from each task, using three independent seeds. The knowledge bank, action policy, prompt, search budget, and evaluation protocol were held fixed across all runs. The SR has a small standard deviation for all three controllers.
Q1. How does the learned Top-5 transformation selector compare with random selection, historical rule statistics, and LLM-based selection?
Response:
Thank you for the question. Appendix Fig. 7 provides this ablation for the transformation selector. Using the same knowledge bank, the context-conditioned policy achieves 70.7% Hit@5 at K=5, compared with 53.6% for historical rule-statistics ranking, while random ranking is substantially lower. The LLM serves a different role: it does not select the Top-5 transformations, but chooses which retained frontier branch to expand after the shortlist has been produced. This separation between transformation ranking and frontier-branch selection is described in Secs. 5.2–5.3 of the revised manuscript.
Q3. Can accumulated evidence reinforce locally attractive but suboptimal actions, and can retained branches recover by returning to a better frontier path?
Response:
Thank you for raising this point. This can happen: a transformation that is useful on average may still be suboptimal for a particular molecule. MOLT re-scores transformations for the current molecule and task, while retaining alternative frontier branches rather than committing permanently to the first choice. Fig. 2b shows a case where the initially attractive branch violates the similarity constraint, while another retained branch later reaches a feasible solution. Consistently, retained branches increase later success from 32.4% to 48.9% (Table 2).
Q4. Please move the caption of Table 2 above the table.
Response:
Thank you for noting this. We have moved the caption above Table 2 in the revised manuscript.