- Rating
- 2(+1)
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduces RouteDiff for synthesis-aware molecular design. By incorporating a masked diffusion model and a bidirectional transformer, the proposed method enables arbitrary generation orders, rather than the left-to-right generation scheme used in conventional methods. Additionally, the method combines ChemBERTa representations with individual embeddings to represent each building block. The method is evaluated on reconstruction and PMO benchmarks.
Critical strengths
None.
Critical weaknesses
-
The primary motivation of this paper—the decoupling of execution and generation—is unclear. The masked diffusion modeling strategy has already been employed by GenMol, which generates permutation-invariant SAFE representations. Moreover, in reconstruction tasks, where building block composition is more important than generation order, ReaSyn outperforms RouteDiff.
-
The proposed method does not support unseen building blocks. The Enamine stock library used in this paper is updated monthly. Various synthesis-aware methods, such as SynFormer and RxnFlow, can utilize unseen building blocks that were not observed during training. In contrast, RouteDiff relies on a library-dependent representation scheme, meaning that a user who downloads the latest Enamine library would be unable to directly use the pretrained model with newly added building blocks.
Questions for authors
Since SMARTS-based reaction templates cannot fully capture chemical reactivity and reactant compatibility, it is important to impose additional synthetic constraints during generation to ensure real-world synthesizability. While conventional left-to-right synthetic route generation schemes naturally allow such constraints to be incorporated, it is unclear how the proposed method addresses this issue. Could the authors clarify how RouteDiff can incorporate additional synthetic constraints during generation?
3 comments
Thank you for the clarifications and additional experiments. The matched AR comparison provides useful evidence supporting the proposed formulation. I acknowledge that this strengthens the empirical case for decoupling token commitment order from postfix execution order. However, two concerns remain.
Practical usability of the pretrained checkpoint and reproducibility
My concern is about the practical usability of the pretrained checkpoint. The Enamine catalog version used in this work may no longer be available for download, and redistributing it requires permission. How can the users use the pretrained checkpoint with the currently available catalog? Since the semantic–identity parameterization is presented as a contribution of this work, its implications for pretrained checkpoint reuse need to be clarified. Given the model’s reliance on catalog-specific identity components, wouldn’t users need to retrain the model on their own catalog rather than directly use the released checkpoint? Do the authors plan to release pretrained checkpoints, and if so, how would they address this issue? Relatedly, how can other researchers reproduce the reported results if they cannot obtain the catalog used in the experiments?
Enforcing additional synthetic constraints during generation
I understand that the synthesis executor can check whether a route is executable under the specified SMARTS reaction templates. My question concerns additional constraints on the reactivity of the actual reactants beyond these template-based checks, such as computational chemistry-based reactivity filters.
Using the example in your response, suppose only BB_A and R_2 have been committed. How can the remaining choices, particularly R_1, be restricted using such filters when the other building blocks and the intermediate are still unknown? These filters may require the actual reactant structures to evaluate whether a proposed reaction is feasible. In left-to-right route generation, they can be evaluated using the instantiated intermediates and candidate reactants before committing to the next action. How is this handled when tokens are committed in an order different from the postfix execution order, particularly since revealed tokens remain fixed?
Your response mentions connecting chemistry-specific validators to route acceptance. If these additional reactivity filters are applied only after route generation, how does this differ from generation followed by filtering? Please clarify whether such constraints can be enforced before token commitment or only checked afterward.
In recognition of the additional evidence from the matched AR comparison, I will raise my rating to 2 (Weak rejection). The concerns above remain unresolved.
We sincerely thank the reviewer for the detailed follow-up and for acknowledging the additional evidence from the matched-AR comparison. We address the two remaining concerns below.
1. Practical usability of the pretrained checkpoint and reproducibility.
We agree that semantic representations alone do not enable exact prediction of unseen catalog identities. ChemBERTa can encode a newly introduced building block, but the pretrained checkpoint does not contain learned identity parameters for that entry. When adapting to an updated catalog, learned identity parameters for shared BBs can be retained after identity alignment, while newly introduced identities require adaptation of the catalog-specific components. This does not necessarily require training RouteDiff from scratch. The pretrained checkpoint can serve as an initialization for such adaptation.
We plan to release the pretrained checkpoint and its reproducibility package by the camera-ready stage if accepted. Importantly, the chemical-space file used in our experiments, enamine2310_rxn115.chemspace, is already publicly available. Other researchers can therefore access the original released resources without relying on the currently available catalog from Enamine. The released checkpoint will be accompanied by instructions for using the matching chemical space. As clarified above, adapting to a different catalog requires updating the catalog-specific identity components rather than directly reusing the original checkpoint without modification.
2. Enforcing additional synthetic constraints during generation.
We appreciate the reviewer's continued input on this point. In the example where only BB_A and R_2 are committed, a reactivity filter requiring the structures of the remaining reactants or intermediates cannot be evaluated before those structures become available. Our standard sampler does not guarantee enforcement of such filters before the initial commitment of those tokens. The inference-time multi-constraint guidance acts before commitment for molecular-property conditions, while the SMARTS executor checks route executability. A chemistry-specific validator applied only to a completed route is indeed post-generation filtering. We appreciate the opportunity to make this boundary explicit.
A possible inference-time extension is validator-guided re-masking and resampling. Once the required reactant and intermediate structures become available, an external reactivity validator could identify reaction steps that violate the specified constraints. Importantly, previously committed BB identities can be revisited through inference-time re-masking without retraining the model. The affected BB positions could then be re-masked, and the same pretrained bidirectional denoiser could resample them conditioned on the retained route context. Repeated validation and targeted resampling could incorporate chemical feedback into subsequent token decisions, rather than only accepting or rejecting complete routes.
To evaluate the feasibility of inference-time revision, we implemented a lightweight, confidence-guided BB revision mechanism using the original RouteDiff checkpoint. At two late steps of the 16-step reverse-diffusion process (t = 6 and 3), the sampler selectively re-masks previously committed BB positions based on prediction confidence and commitment age, and resamples their identities using the same bidirectional denoiser. A replacement is accepted only if its conditional BB log-probability exceeds that of the original identity.
In an additional Experiment 1 evaluation, the inference-time BB revision variant achieves 93.0% reconstruction (vs. 92.8% for the original RouteDiff sampler), 0.988 mean-best similarity (vs. 0.987), 0.098 pathway diversity (vs. 0.113), and 0.804 BB diversity (vs. 0.783) on Enamine, without retraining. On ChEMBL, it achieves 23.3% reconstruction (vs. 21.0%), 0.748 mean-best similarity (vs. 0.733), 0.037 pathway diversity (vs. 0.040), and 0.316 BB diversity (vs. 0.291). These results provide evidence that inference-time BB revision can be incorporated into RouteDiff while maintaining strong reconstruction and diversity performance using the original model parameters.
The evaluated revision mechanism is guided by model confidence rather than external chemical validation, and currently revises BB identities only. Nevertheless, the ability to revisit committed BB decisions using the original checkpoint provides a concrete starting point for incorporating reactivity feedback during inference. Integrating reactant-dependent validators to identify incompatible reaction steps and guide targeted re-masking of the implicated BB and reaction positions remains future work.
We thank the reviewer again for the constructive discussion and will clarify these points in the revised manuscript.
We thank the reviewer for the opportunity to clarify the execution-order motivation, the catalog setting, and inference-time constraint conditioning.
Execution order refers to how a completed postfix route is executed—not how its tokens must be generated. For example, in
[BB_A, BB_B, R_1, BB_C, R_2], the executor pushes BB_A and BB_B, applies R_1 to form an intermediate, then applies R_2 with BB_C. These stack dependencies determine the chemical meaning of the sequence. RouteDiff preserves them unchanged (Sec. 2.1).The key observation is that execution order need not determine prediction context or commitment order. A postfix autoregressive model must commit an upstream BB before generating downstream reactions. RouteDiff instead denoises the entire masked postfix route: the bidirectional Transformer predicts still-masked positions using currently revealed tokens on either side, and the reverse diffusion process selects positions for commitment independently of their postfix indices. Thus a revealed downstream reaction may inform an unresolved upstream BB, while the completed route still executes in postfix order. Once a token is revealed it remains fixed. Our revision analysis concerns predictions before commitment (Sec. 2.2).
This is distinct from GenMol and ReaSyn. GenMol diffuses SAFE molecular-fragment representations, rather than generating complete executable synthetic routes specifying purchasable BBs, reaction-template identities, and stack dependencies. ReaSyn combines bottom-up/top-down autoregressive pathway generation with iterative subtree refinement and a separately trained Edit Bridge for whole-pathway editing. In contrast, RouteDiff performs bidirectional prediction and non-postfix commitment of masked route tokens within a single whole-route reverse-diffusion process, while preserving the same postfix execution semantics. Thus, it allows unresolved route decisions to incorporate global context before commitment within one whole-route generation.
Against published synthesis-constrained baselines, RouteDiff leads on 8/10 original PMO objectives (Table 3). In the matched AR comparison, it retains comparable Enamine reconstruction (92.8% vs. 92.6%) with higher BB diversity (0.783 vs. 0.756; Table 2). In a success-conditioned cohort, 36/48 trajectories show pre-commit BB/reaction prediction revisions (Appendix E.2).
A specified building-block catalog and reaction-template set are fundamental to synthesis-constrained generation. Together they define which routes can be executed. Dynamic vendor-catalog expansion is a separate design dimension from the order-decoupling question. It is notable that RouteDiff operates at substantial scale, with 223,243 purchasable Enamine building blocks and 115 reaction templates, enabling exact selection among over 223k identities at BB positions.
The semantic–identity interface is designed for this scale. ChemBERTa prototypes capture chemical relationships, while learned low-rank identity components distinguish exact catalog entries (Sec. 2.3). The controlled ablation gives 92.8% Enamine reconstruction for the full interface versus 88.1% without both components (Table 2). ChemBERTa can encode new molecular entries. Updating exact catalog identities concerns the indexed input/output interface, rather than the whole-route diffusion mechanism.
Experiment 3 implements multi-constraint guidance during generation, not merely post-hoc ranking. RouteDiff accepts molecular fingerprints and exact-value, upper-bound, and lower-bound scalar conditions. At every reverse diffusion step, the shared denoiser evaluates each condition on the same partially masked route, and positive-weight sums of the resulting token-type, BB, and reaction logits define the sampling distributions before positions are committed (Sec. 2.4 and Appendix C.3). Thus multiple constraints jointly guide route-token decisions without task-specific retraining.
Synthesis compatibility can be addressed through the executable route representation. The stack executor applies SMARTS reactions to the instantiated intermediates and checks whether a sampled route can be executed successfully. For further catalog/reaction restrictions, the typed BB/reaction distributions provide a direct interface for masking disallowed choices, and additional chemistry-specific validators can be connected to route acceptance. Neither mechanism requires left-to-right commitment. RouteDiff therefore preserves postfix execution semantics while incorporating molecular constraints into the reverse generation process.