- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduces ATOM, a framework for multi-objective molecular optimization that combines property-specific LLM agents with Monte Carlo tree search. The method explores different sequences of molecular optimization steps while keeping track of each search path's history. Agents exchange useful molecules and strategies through local coordination and a shared Pareto memory. Across eight tasks, ATOM achieves the best mean hypervolume on six. Ablation studies suggest that knowledge sharing and maintaining consistent path histories both contribute to performance.
Critical strengths
-
I find the use of optimization history interesting. ATOM allows different search branches to follow their own sequences of optimization steps while still sharing useful information.
-
The ablations are well designed. Together, the flat-coordination and path-history controls help test whether the gains come from tree structure and consistent path histories, rather than just providing more agents or additional context.
Critical weaknesses
-
The linked implementation differs substantially from the method described in the paper. Equations 5–8 use local hypervolume rewards and UCT, whereas the available code uses mean property scores and different selection and backup rules. If this is a versioning issue, the authors could clarify it.
-
It is unclear how path history is represented and updated in practice. Sections 3.1 and 4 describe ordered specialist histories and accumulated optimization strategies, while Appendix E describes the path strategy as a short summary of objective status and the current best candidate. How does the structural-edit summarizer in Figure 11 relate to this representation? A concrete example showing how the history changes along a branch would be helpful.
Questions for authors
As mentioned in the Weaknesses, could the authors clarify the discrepancies between the released code and the equations in the paper? Also, how exactly is path history represented and updated in practice?
4 comments
Thank you once again for your valuable comments on our submission. As the discussion phase is approaching its end, we would like to kindly confirm whether we have sufficiently addressed all of your concerns. Should there be any remaining questions or areas requiring further clarification, please do not hesitate to let us know. If you are satisfied with our responses, we would greatly appreciate your consideration in adjusting the evaluation scores accordingly. We sincerely look forward to your feedback.
Thank you for your response. The given case helps clarify how path history is represented and used in ATOM. However, some inconsistencies remain between the paper and the released code, including the implementation differences I raised and the issue noted by Reviewer 6sLB. Given these remaining concerns, I will maintain my original score.
Thank you for following up and for pointing out these inconsistencies. The manuscript PDF and the anonymous code repository had not yet been updated when we posted our earlier response. Both have now been updated to address the discrepancies you and Reviewer 6sLB identified. The changes are marked with blue boxes in the revised PDF. We appreciate your careful review and feedback.
Dear Reviewer Zz1f,
Thank you for identifying where the release and manuscript need to be aligned. We clarify the search reward and the implementation of path history below.
Q1. The linked implementation differs substantially from the method described in the paper. Equations 5–8 use local hypervolume rewards and UCT, whereas the available code uses mean property scores and different selection and backup rules. If this is a versioning issue, the authors could clarify it.
Response. The anonymous repository contained an earlier version of ATOM that guided search using the mean of normalized objective scores. All results in Table 1 were generated with the manuscript implementation, which uses local hypervolume rewards and the UCT selection and backup rules described in Equations 5–8. The repository mismatch therefore does not affect the reported results or the paper’s conclusions.
Q2. How is path history represented and updated?
Response. In the experimental implementation that uses the strategy summarizer, each child node records the specialist that created it, its molecular population, and a short strategy note. Its population includes candidates retained after scoring and filtering, along with selected references from its parent’s Pareto front. The parent links recover the order of specialist calls along the branch.
When a specialist expands a node, it uses the node’s population, retrieved references, and strategy note to propose edits. After filtering, the Figure 11 summarizer compares the parent population with the newly retained candidates as two unpaired sets. It records up to five recurring structural edits in the child’s note. If it finds no clear pattern, the child inherits the parent’s note.
For example, after a QED specialist expands a node, the summarizer may identify ring formation as a recurring edit. An SA specialist can then use that note and the QED node’s molecular references when proposing its own edits. If amide formation emerges as a recurring edit among the retained SA candidates, the SA child stores it in its own note for later expansions.
Appendix E describes a deterministic summary of objective status and the current best candidate. In the configuration described above, the strategy passed to later specialists is the structural-edit note from Figure 11.
We appreciate your insightful feedback and suggestions, which have helped us strengthen the presentation, validation, and overall quality of ATOM.