- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
I think this is a solid and well-motivated work. The paper identifies two key limitations of existing approaches: (1) discrete synthesis-based optimization follows realistic chemical reaction constraints but can suffer from limited search efficiency in large combinatorial spaces; and (2) continuous molecular optimization can generate promising molecules, but the resulting candidates may not be directly synthesizable and often require additional searches for synthesizable alternatives.
To address these limitations, the authors propose a continuous route latent space that enables optimization over synthesis routes. They also introduce a cycle-consistency mechanism to discourage exploration of unreliable regions in the latent space and improve decoding stability.
The proposed method achieves strong overall performance across molecular optimization benchmarks, with state-of-the-art results on several synthesizability and molecular quality metrics. The paper also provides meaningful ablation studies that generally support its main arguments.
Critical strengths
1.Well-motivated and coherent methodological design.
The paper introduces an interesting perspective on synthesizable molecular optimization by moving the search from discrete synthesis routes to a continuous route latent space. The proposed representation and chemistry-constrained decoder allow latent variables to be mapped into executable synthesis routes. The authors also recognize the potential issue of unreliable latent-space decoding and introduce cycle consistency to mitigate it. Overall, the framework is reasonably designed, and its components are well connected to the central motivation.
2.Practical relevance and strong empirical performance.
The work addresses a meaningful gap between discrete synthesis-based optimization and continuous molecular optimization. While the former naturally incorporates chemical synthesis constraints but faces challenges in search efficiency, the latter enables flexible optimization but does not necessarily ensure synthesizability. RouteFlow attempts to combine the advantages of both approaches and achieves strong results across 16 optimization tasks. I also appreciate the search-space comparisons in Table 5 and the ablation studies in Figure 4 and Table 6, which provide useful evidence for the effectiveness of the proposed design.
Critical weaknesses
- Limited isolation of the benefits of continuous route latent optimization.
The introduction emphasizes the limitations of existing discrete synthesis-based optimization methods. However, the experiments do not fully isolate the advantages of continuous route latent optimization over discrete route-based search. Although Table 5 provides a useful comparison between molecular and route latent spaces under different optimizers, a more controlled comparison with discrete optimization using the same structured route representation would help better establish the specific contribution of the proposed continuous formulation.
- Insufficient comparison of computational efficiency.
Although RouteFlow demonstrates strong performance in terms of oracle efficiency, the framework introduces additional computational costs through the encoder, decoder, and pretraining stages. The paper reports computational costs for individual components, but a direct quantitative comparison of end-to-end computational efficiency with existing synthesis-constrained methods is still limited. Such a comparison would help clarify the practical efficiency gains of the proposed approach.
Overall, despite these limitations, I believe the proposed framework is well motivated, technically sound, and supported by strong empirical results. The remaining concerns do not substantially affect my positive assessment of the paper.
Questions for authors
-
Multiple distinct synthesis routes may lead to the same final molecule. How does the proposed route latent space represent this many-to-one relationship? Although the replay buffer includes molecular similarity-based deduplication, could route multiplicity still affect the learned latent geometry or introduce sampling biases?
-
Could the authors provide a more controlled comparison between continuous route latent optimization and discrete reward-guided optimization using the same structured route representation, route data, reaction templates, building blocks, and oracle budgets? This would help clarify the independent benefits of continuous latent-space optimization.
6 comments
Thank you for the detailed response and the additional experiments. I appreciate the authors' efforts, especially the new discrete BO comparison and the analysis of molecular novelty.
After reading the rebuttal, I have a better understanding of what RouteFlow actually demonstrates. Initially, I thought that learning a continuous route latent space would also help the model explore more complex, multi-step synthesis routes.
However, the new results on route lengths made me reconsider this. Around 81.4% of the training routes are one-step routes, and more than 92% of the top-100 molecules in each of the three docking tasks also come from one-step routes.
I understand that shorter routes are useful in practice, and I don't think this is necessarily a problem with the method itself. But I still feel that the experiments haven't fully shown the value of learning a continuous latent space for complete synthesis routes, especially when it comes to more complex routes.
So my current view is that RouteFlow is a solid framework for finding high-scoring molecules with computationally executable synthesis routes. The additional experiments support this, and I still think the work has good practical value. However, I am less convinced that some of the broader advantages of the proposed route latent space have been fully demonstrated.
For these reasons, I have adjusted my rating from 4 to 3, while remaining positive about the paper.
Thank you for the clarification. We agree that the current results, dominated by one-step routes, do not yet establish an advantage for multi-step synthesis. We think that increasing the sampling of multi-step synthesis routes during offline data generation could help balance the route length distribution in the training data and potentially improve the model's ability to explore more complex synthesis routes. We will elaborate on this potential direction in the discussion section of the revised manuscript.
Thank you again for your continued engagement.
We thank the reviewer for the positive assessment of our work.
Thank you for suggesting this comparison. We additionally evaluated discrete Bayesian optimization directly over the 300K training-route library on the three docking tasks. RouteFlow's continuous route latent space consistently outperforms discrete optimization over this library.
Thank you for the question. We use a replay buffer to manage multiple routes leading to the same molecule. At each iteration, 80% of the samples used to update the flow model are freshly drawn. This design intentionally trades off some route multiplicity to improve molecular properties during optimization.
For the concern about computational cost, routeFlow requires autoencoder pretraining, which adds an upfront cost compared with GFlowNet-based methods. Its total computational cost still remains lower than the pretraining costs of ReaSyn and SynFormer. The tables below summarize total compute cost across all 16 tasks and oracle budget across methods.
Thanks again for your time and thoughtful review.