- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies molecular generation conditioned on multiple target properties, aiming to produce chemically valid molecular graphs that closely match the specified targets.
To address the risk that reverse-trajectory policy updates may impair structural generation capabilities, GraphFDM builds on the CoMole backbone and uses terminal molecular rewards to weight denoising training on re-noised samples.
Since the inherited backbone (CoMole) samples node counts from a fixed distribution, GraphFDM also introduces SDC to adapt the proportions of molecules with different node counts. SDC places node counts and conditional structures under a common reward objective, constrains their changes separately, and uses the same weights to train the node-count network and denoiser.
Experiments on polymers and QM9 include comparisons from a shared initialization and ablations of SDC and KL budget allocation. The full method achieves the lowest MAE for each target property among the compared methods while maintaining high raw validity.
Critical strengths
S1. Tables 1 and 2 compare CoMole and both GraphFDM variants from the same SFT initialization. GraphFDM without SDC already improves property matching and raw validity, and the full method provides further overall gains. Its raw validity reaches 98.6% on polymers and 96.0% on QM9.
S2. SDC connects node-count adaptation and conditional structure learning through a common reward objective, with both theoretical derivations and ablation results. Table 4 compares joint and separate constraints under the same total KL budget and training configuration, providing evidence for the benefit of separate budget allocation.
S3. The experiments examine several forms of generalization and robustness. Table 3 tests property combinations that are rare in the QM9 conditional training set. Table 9 reports multiple-seed results on QM9, and Table 11 checks method rankings by rescoring the same generated polymers with alternative property predictors.
Critical weaknesses
W1. Two aspects of the explanation for the performance gains remain unclear. Tables 1 and 2 show that the post-training approach works, but do not fully explain how the change in supervision mitigates structural degradation. For SDC, Proposition 3.2 and the ablations support the design, but the paper does not show what node-count mismatch occurs for the tested targets or how SDC corrects it. (Q1 and Q2 addresses this concern.)
W2. The property predictors’ accuracy on generated molecules remains uncertain. Table 10 reports training-set fitting errors. Table 11 checks ranking robustness across predictors trained on the same labeled data, rather than assessing prediction accuracy on new structures. The evidence for improving the surrogate objectives is therefore stronger than the evidence for improving actual molecular properties. (Q3 addresses this concern.)
Questions for authors
Please prioritize Questions 1–3. They can serve as the response to the corresponding weaknesses; there is no need to answer both sections (Weaknesses & this sec) separately.
Q1. What evidence supports reward-weighted denoising as a way to mitigate the risk of structural degradation from reverse-trajectory policy updates? For example, could existing checkpoints or generation logs show how property error, raw validity, and structural errors evolve during post-training? Please explain what these observations reveal about the change in supervision and which components’ contributions remain difficult to distinguish.
Q2. For representative target conditions, could you compare the node-count distribution before an update, the SDC target distribution, and the learned distribution after that update? Please relate these distributions to the property performance of candidates with different node counts, to explain what mismatch arises in practice, how SDC addresses it, and why the adjustment is beneficial.
Q3. How reliable are the property predictions used to evaluate generated molecules? Beyond the training errors in Table 10 and ranking comparison in Table 11, are held-out or cross-validation errors available? How structurally similar are the generated molecules to the predictors’ training molecules, and what does this suggest about the predictors’ applicability to the generated structures?
Questions 4–5 are just secondary implementation clarifications. Brief explanations of the settings used in the reported experiments are sufficient.
Q4. The supplementary code appears to assess validity and properties using repaired molecules while retaining the original sampled graphs as training targets. Was this procedure used in the reported experiments? If so, how does it align with the definition of valid molecular graphs and the guarantees in Eq. (4) and Corollary 3.4?
Code references: graphfdm/common.py, decode_samples, lines 240–256; graphfdm/policy.py, save_round_dataset, lines 185–209.
Q5. Which standard deviations were used for reward normalization? Eqs. (42)–(43) specify training-set standard deviations after log transformation for gas properties, whereas the default preparation script computes them on the original scale, and the reward code subsequently reads these statistics. Please clarify the settings used in the reported experiments, since this changes the relative weighting of properties in the reward.
Code references: scripts/prepare_polymer.py, lines 60–69; graphfdm/common.py, evaluate_final_surface, lines 294–298.
Thanks, the additional experiments substantially strengthen the paper and address several of my original concerns. I still have some reservations regarding the methodological novelty, particularly the overlap with RWR, and the limited scope of the experiments. However, I think the additional evidence provides a stronger justification for the proposed method.
A few remaining issues:
Overall, I think the rebuttal addresses enough of my original concerns to warrant increasing my score from 2 to 3. I would appreciate clarification and correction of the remaining issues above.