- Rating
- 3(+1)
- Confidence
- 1(−1)
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Plan, Guide, and Repair (PGR), a sampling-time control framework for conditional molecular graph diffusion that aims to improve property alignment and chemical validity without retraining the pretrained diffusion backbone. PGR decomposes the generation process into three complementary stages: (1) Plan predicts a condition-dependent molecular size before sampling; (2) Guide trains a property predictor on actual reverse diffusion trajectories to estimate endpoint properties and uses its gradients to steer generation toward the desired conditions; and (3) Repair performs chemistry-constrained edge resampling at late diffusion steps to correct valence, aromaticity, and connectivity violations. The method is evaluated on continuous multi-property polymer generation using MELD and categorical molecular generation using Graph DiT on BACE, BBBP, and HIV. Experimental results show improved property alignment and raw molecular validity compared with the underlying backbones. Ablation studies further support the contributions of the three components, showing that Plan improves size selection, Guide enhances property control, and Repair improves chemical validity while preserving property alignment.
Critical strengths
- The experiments are comprehensive, and the results show the effectiveness of the proposed method in condition control.
- Figures are helpful for understanding.
Critical weaknesses
- The main concern is the lack of details, necessary background, and critical explanation. There is no background, qualitative example, or problem setting in this paper, which makes it hard to understand the scope of this paper. Moreover, in the methods section, some critical steps lack explanation or further demonstration. Some methods lack motivation and seem heuristic.
Questions for authors
- It would be better to give an example of and the background of your problem.
- What is the representation of ? A text prompt?
- If we can build the training pairs , does it mean that we can infer from ? If so, then why can't the model itself do such an inference? Also, what if we need a smaller or larger count in inference that does not exist in training?
- I am not clear about the motivation of Eq.5 and 6. If my understanding is correct, we are using the property of the final to guide the generation. However, as is the final outcome of the generation, it seems that we are emphasizing the generation toward , but not introducing new signals.
- Is Sec.3.4 for inference or training?
- The definition of illegal properties in Eq.10 seems heuristic. I am an expert in molecule generation, so I wonder if the four potential mistakes are well considered by the community. It would be better if the authors could show evidence that supports the construction of the four mistakes.
- I think the paragraph on backbone-specific instantiation can be moved to the experiment section
8 comments
Q4: What motivates Eqs. (5)–(6)? Does using the final create a circular dependency?
Response. We sincerely thank the reviewer for raising this important question. There is no circular dependency because is used only when constructing the supervision data offline. With Guide disabled, we first complete a reverse trajectory and then use from that same trajectory to supervise its intermediate state . During generation, the future does not yet exist. The frozen predicts endpoint properties only from the current , and its gradient modifies the next sampling distribution. Eqs. (5)–(6) therefore learn where the current state is likely to end, rather than reading a future endpoint during generation.
Q5: Is Section 3.4 used for inference or training?
Response. We sincerely thank the reviewer for requesting a direct clarification. Section 3.4 in the original manuscript described inference/generation. In the revised manuscript, Guide supervision is presented in Section 3.4, “Guide Supervision from Reverse Trajectories” (lines 213–263), while the active guidance process corresponding to the original Section 3.4 appears in Section 3.5, “Guide as an Active Reverse-Process Controller” (lines 265–301). The former trains using completed trajectories. The latter freezes its parameters, predicts from the current soft posterior at every reverse step, differentiates with respect to the inputs, and then samples the next hard state.
Q6: Are the four violation statistics in Eq. (10) of the original submission supported by established domain practice?
Response. We sincerely thank the reviewer for asking about the basis of these definitions. The four-dimensional violation statistic referenced by the reviewer was Eq. (10) in the original submission. Because the revised manuscript adds an equation, this definition is now Eq. (11), ; Eq. (10) in the revised manuscript is the categorical guidance loss for Guide. Eq. (11) operationalizes commonly used checks for valence, aromatic-cycle consistency, and single-molecule connectivity as four monotonically comparable statistics. These checks are used or discussed in MOSES, Open Babel, the SMILES specification, and DiGress [1,4–6]:
| Statistic | Exact implementation definition | Corresponding domain check |
|---|---|---|
| Number of edges in the aromatic-edge-induced subgraph that cannot remain in its degree-two cyclic core | Aromatic bonds must belong to a consistent Kekulé/cyclic system | |
| Number of atoms whose current total bond order exceeds the capacity of the atom type | Incidence of overvalent atoms | |
| Total severity of valence excess | ||
| , where is the number of connected components | A generated molecule should form one connected molecular graph |
and measure the incidence and severity of valence violations, respectively. Repair accepts an edit only when at least one statistic decreases and none increases, preventing an apparent improvement obtained by introducing a more severe local valence violation.
[4] O'Boyle et al., “Open Babel: An open chemical toolbox,” Journal of Cheminformatics, 2011. DOI: 10.1186/1758-2946-3-33.
[5] Weininger, “SMILES, a chemical language and information system. 1. Introduction to methodology and encoding rules,” Journal of Chemical Information and Computer Sciences, 1988. DOI: 10.1021/ci00057a005.
[6] Vignac et al., “DiGress: Discrete Denoising diffusion for graph generation,” ICLR 2023. arXiv: 2209.14734.
Q7: Move the backbone-specific instantiation paragraph to the experimental section
Response. We sincerely thank the reviewer for this structural suggestion. We adopted it and moved “Backbone-specific instantiation” to Section 4, “Experimental Setup,” immediately after “Tasks and backbones” (lines 339–353; the relocated paragraph is in lines 345–353).
Thanks for your careful rebuttal. However, a few concerns still exist.
- Q3: The revised Eq.4 still requires the model to select from the training pairs. Though the users can assign the count themselves, it actually skips the plan step.
- Q4: Can we use a property predictor instead of an endpoint predictor to guide the generation? Also, the difference of states during training and inference may introduce drift. It is hard to tell the results in Table S8 where hard states are better than the soft ones
Response to Reviewer SRzx
We sincerely thank the reviewer for the specific questions concerning the problem formulation, notation, and algorithmic stages. We address each point below.
W1: Insufficient background, problem scope, and qualitative examples
Response. We sincerely thank the reviewer for identifying the need for additional background. A common molecular-design setting is to generate new chemical structures from requested functional properties, such as synthesizability, gas permeability, biological activity, or blood-brain barrier permeability, rather than merely scoring existing candidates. This work studies precisely this structured-property-conditioned generation of new two-dimensional molecular graphs. On top of a frozen discrete graph-diffusion backbone, PGR separately handles condition-dependent molecular size, property deviation during reverse generation, and local graph validity. We expanded the application context and problem background in Section 1, “Introduction” (lines 33–45), and specified the input, output, and study scope in Section 3.1, “Problem Formulation” (lines 148–161).
W2: Insufficient motivation for key steps, making them appear heuristic
Response. We sincerely thank the reviewer for emphasizing the design motivation. The three modules follow the order in which information becomes available during reverse generation: Plan selects molecular size before topology forms, Guide corrects endpoint properties from the current state during sampling, and Repair addresses valence, aromaticity, and connectivity after atom and bond identities begin to resolve. The necessity of Guide and Repair and the corresponding ablation evidence are detailed in our response to Reviewer TmK1, W2.
Q1: What is Zt? Please provide an example and additional problem context
Response. We sincerely thank the reviewer for requesting an intuitive definition. Zt=(Xt,Et) is the partially denoised molecular graph at reverse step t, containing its current atom and bond categories together with unresolved mask states. Z0 is the final discrete molecule. We clarified the problem setting and the definition of Zt in Section 3.1, “Problem Formulation” (lines 148–161), and Section 3.2, “Conditional Graph Diffusion with Decomposed Control” (lines 182–195). We also added authentic Test reverse trajectories for all four tasks in Appendix D.4, “Authentic Reverse Trajectories” (lines 1041–1044), and Figure S2 (lines 1118–1122). For O₂/N₂/CO₂, BACE, BBBP, and HIV, Figure S2 follows one authentic trajectory at t/T=1.00,0.60,0.40,0.20,0.00, using a fixed graph layout within each row.
Q2: What does c represent? Is it a text prompt?
Response. We sincerely thank the reviewer for requesting clarification. c is not a text prompt. It is a structured numerical or categorical property condition. For example, the continuous task may request
(SA, O₂, N₂, CO₂)=(3.32,1200,610,4700), whereas BACE may request(SA, class)=(3.46, active). Continuous quantities are normalized using training-set statistics before being provided to Plan, the backbone, and Guide.Q3: Why can the backbone not infer N itself? What happens for node counts smaller or larger than those seen during training?
Response. We sincerely thank the reviewer for asking about this interface. This is not an additional restriction imposed by PGR, but the native sampling design of MELD and Graph DiT. The node count N and its corresponding node mask must be specified before reverse diffusion begins. The diffusion process updates atom and bond categories on this fixed node support, while node count itself is not part of the diffusion state. The backbone therefore cannot infer N during sampling; the count must be selected by Plan or specified by the user in advance. For a node count not observed during training but still within the backbone's capacity, the user can directly set
num_nodes=N.