- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Fraglingo, a molecular generation framework that performs autoregressive fragment assembly via continuous representation retrieval. The model uses a shared graph encoder and performs attention readout with active attachment points as queries to predict attachment-point-aware representations of the next fragment. By retrieving candidate "fragment–attachment point" representations, the model simultaneously determines the new fragment and how it is attached. Training combines InfoNCE, auxiliary fragment classification, and RVQ regularization; at inference time, the model allows encoding of new fragments and expansion of the candidate library without retraining the generator. The authors apply the framework to molecular generation, molecular optimization, scaffold generation, and scaffold decoration, and report experiments on joint property control, component ablations, data and model scale, and inference-time vocabulary expansion. The paper has a reasonable technical motivation and potential practical value. However, the current manuscript does not adequately define its added contribution relative to existing attachment-point-aware generation and retrieval methods; there remains an unresolved confounding factor between the strongest performance and the fragment partitioning scheme; and the experimental coverage and several reporting issues also limit the credibility of the core conclusions.
Critical strengths
- Clear correspondence between problem and design. Different attachment points of the same fragment may lead to different assembly outcomes, so establishing conditioned representations for fragments and their attachment positions is a reasonable modeling choice.
- Decoupling the candidate library from fixed output classes has practical significance. Table 4 shows that the model can select fragments outside the training vocabulary, indicating that expanding the candidate library at inference time is operationally feasible.
- Broad experimental coverage. The appendix includes experiments on loss components, data scale, vocabulary size, model scale, and other molecular design tasks, providing a certain basis for analysis.
- Some results are attractive. The BFE version demonstrates good joint property control, and the molecular optimization results also show good target matching and structure retention.
Critical weaknesses
W1. The core novelty has not been adequately established, especially the lack of positioning and comparison with directly related work such as MiCaM. Attachment-point-aware fragment generation already has clear precedents. FREED explicitly models the current molecular attachment point, candidate fragments, and candidate fragment attachment points, and makes subsequent decisions depend on prior selections; MoLeR also includes an attachment point selection mechanism. Therefore, "considering attachment point context" itself cannot be regarded as a new contribution. More directly relevant is MiCaM (ICLR 2023). Its §2.2 uses "*" to retain attachment information, starts from the current attachment point, constructs queries from graph and node representations, and scores candidate attachment point representations, thereby simultaneously determining the new fragment and its attachment mode. Appendix A.4 also uses in-batch positive and negative samples for contrastive training. The manuscript does not discuss this important precedent. The authors need to clearly explain what capability the wildcard-anchored readout in this paper adds relative to existing attachment point query and joint selection mechanisms. The existing readout ablation provides some evidence, but lacks direct comparisons such as attachment point node representations, global pooling and concatenation with attachment point representations, and stepwise fragment/attachment point prediction. The t-SNE in Figure 3 mainly shows that representations vary with attachment points; it cannot sufficiently prove that attachment point selection is more accurate, nor that there is a consistent geometric transformation in the original representation space. In addition, the distinction between "continuous retrieval" and "classification" needs to be defined more precisely. Applying softmax scoring to dynamic candidate structure representations is not the same mechanism as using a classification head with fixed class parameters. MiCaM already belongs to the former candidate matching approach. Its vocabulary transfer experiment involves parameter fine-tuning, so it cannot yet be used to deny the value of this paper's "library expansion without retraining"; however, this paper should verify this added capability under the same frozen library expansion protocol. W2. Coverage of related work on retrieval and vocabulary expansion is insufficient, and the closest methods are not adequately discussed. DeepFrag has already adopted the approach of predicting fragment fingerprints and then matching fragments through a candidate library, and allows the candidate set to be independent of the training set. RetMol guides controllable generation by retrieving example molecules and dynamically updating the database. f-RAG directly studies fragment-level retrieval and expanding the fragment vocabulary during generation. These are respectively relevant to this paper's claims regarding representation retrieval, controllable generation, and candidate library expansion. These methods are not identical to Fraglingo, but the current manuscript does not fully explain the differences or establish added value through representative quantitative comparisons. In particular, f-RAG should be regarded as an important reference for fragment retrieval and vocabulary expansion. GEAM's research on dynamic target-related fragment vocabularies should also be included in the contribution positioning. The main issue here is not the number of baselines itself, but that the existing comparisons do not adequately cover the closest mechanisms and capabilities. W3. The strongest performance is confounded with the fragment partitioning scheme, and existing ablations cannot fully attribute it to continuous retrieval. In Table 2, the standard BRICS version has NJD 1.9808 and Joint@1× 40.88%, lower than MolGPT and MolRWKV on these property control metrics; its advantage is mainly reflected in the 100% validity rate. Therefore, the results reflect trade-offs across different dimensions and cannot yet support the claim that the standard version is generally superior in property control. The BFE version raises Joint@1× to 69.65%. In comparison, removing the attachment point readout reduces the BRICS version from 40.88% to 34.66%. Although these differences cannot be directly interpreted as the proportional contribution of each component, they indicate that fragment granularity has a significant impact on the results. The authors need to clarify whether different partitioning schemes use exactly the same molecule sets and test targets, and compare generation mechanisms under matched partitioning schemes. Appendix A replaces InfoNCE with MSE, but both retain continuous vector prediction and nearest-neighbor retrieval. Therefore, this experiment verifies the role of the training objective and cannot independently prove that continuous retrieval is superior to discrete output mechanisms. The most direct missing control is: fixing the encoder, data, fragment partitioning, and condition input, and changing only stepwise prediction, compositional classification, and continuous retrieval. In addition, filtering training molecules according to different vocabulary coverage conditions causes vocabulary changes to be accompanied by data distribution changes. Therefore, some scale experiments cannot fully isolate the effect of vocabulary size. W4. The vocabulary expansion experiment mainly demonstrates that new fragments are selected, but does not sufficiently prove that expansion brings effective generalization. "Open vocabulary" as a capability to add new candidates after training is reasonable. However, in Table 4, after the 500-fragment model is expanded to 2000 fragments, NJD rises from 1.4928 to 1.8628, Partial drops from 6.56 to 6.16, and Diversity only rises from 0.8218 to 0.8382. These results show a trade-off between coverage and property control. A higher OOV fragment selection ratio alone is not sufficient to show that new fragments are correctly utilized, because it may also be affected by the number of candidates and the embedding distribution. It is recommended to report independent performance for molecules containing OOV fragments, Joint@1× after expansion, and the structural distance between new fragments and training fragments. A few cases showing that new fragments help satisfy objectives that are difficult to achieve with the original candidate library would also be more convincing than reporting only the OOV selection ratio. W5. Property and task evaluation is not yet sufficient to fully test attachment mode modeling and broader molecular design capability. The seven properties are mainly two-dimensional physicochemical descriptors and overlap in definition. QED itself integrates information such as MW, logP, polar surface area, hydrogen bond donors and acceptors, and rotatable bonds, so the seven metrics cannot be regarded as validation of seven independent property categories. The low computational cost of properties does not mean joint control is necessarily easy. However, molecules produced by different attachment positions can have the same MW, HBD, and HBA, as well as similar other descriptors. Therefore, the current evaluation may not sufficiently distinguish the quality of attachment modes. It is recommended to add attachment point selection evaluation involving symmetric equivalent positions, and to expand the target types using representative PMO activity prediction or complex MPO tasks, such as DRD2, GSK3β, JNK3, and Sitagliptin or Ranolazine MPO. The original PMO does not include docking; its activity targets use predictive models; evaluation should also unify the oracle budget and report sample efficiency. Molecular optimization also lacks a baseline that "directly returns the original molecule." Because training and test pairs have high structural similarity and limited variation, the original molecule may already satisfy some looser objectives. Reporting only final NJD and similarity is insufficient to judge the actual degree of improvement. The change in target distance before and after optimization and the improvement rate should be reported. In addition, scaffold generation and decoration mainly rely on self-comparison. MoLeR and PromptSMILES already have scaffold-constrained generation or decoration capabilities, and interface differences are not sufficient to completely replace representative comparisons. For overall optimization capability, it is valuable to appropriately add search-based methods, but MCTS should serve as a supplementary reference rather than a necessary substitute for validating attachment point representations. W6. There are specific contradictions and missing key details in the experimental reporting. The following issues need to be explicitly checked:
- Contradiction in threshold success rates in Table 5: The MSE row has Joint@1× 26.85%, while Joint@2× is 24.94%. Under the same samples and statistical method, relaxing the tolerance should not reduce the success rate.
- Inconsistent data split description: The main text states an 8:1:1 scaffold split, while Appendix F describes a 90/10 training/validation split. If there is a nested relationship, it needs to be explained.
- Generation randomness is unclear: The appendix describes selecting the highest-similarity candidate at each step, but does not fully explain where the random differences among 20 samples under the same property condition come from.
- Incomplete statistical reporting: The main text claims to report means and standard deviations over three random seeds, but the strongest BFE configuration and several key experiments do not provide standard deviations.
- Unclear optimization baseline condition interface: Appendix F.2 does not fully explain how HierVAE uses the seven-dimensional target properties, nor does it provide the complete JT-VAE experimental setup.
- Numerical values in qualitative examples need verification: In the left side of Figure 5, the MW target is 500, the generated value is 344, yet the reported error is −28.5, which is inconsistent with the displayed value. These issues are not all of equal severity, but together they limit reproducibility and interpretation of the results.
Questions for authors
- Relative to MiCaM's existing attachment point query, joint fragment selection, and contrastive training, what is the substantive new contribution of this paper? Can you provide mechanism comparisons with matched backbone and data?
- Do BFE and BRICS use the same molecule sets and test targets? What are the repeated-experiment statistics for the strongest BFE configuration?
- When expanding the candidate library with frozen parameters, what advantage does this paper have over existing candidate representation matching methods? Can molecules containing OOV fragments still reliably satisfy the objectives?
- Can the current seven-property evaluation effectively distinguish different attachment modes? Can attachment-point-specific evaluation and a small number of representative activity/MPO tasks be used to strengthen the evidence?
- How much does molecular optimization improve over directly returning the input molecule? Do all baselines receive the same target information?
- How should the threshold contradiction in Table 5, the data split description, and the generation randomness mechanism be explained? Overall Assessment I acknowledge the potential value of attachment-point-conditioned representations and inference-time candidate library expansion. However, the current version has not yet sufficiently answered three decisive questions: what is added relative to the closest existing mechanisms; whether the strongest performance comes from the generation mechanism or the fragment partitioning; and whether expanding the candidate library and applying it across tasks brings verifiable benefits. My inclination to reject is mainly based on these evidence gaps and the unresolved experimental reporting issues. If the authors can clearly define the differences from MiCaM and retrieval-based work, provide targeted matched comparisons, and correct key experimental contradictions, I would be willing to reassess the recommendation.