- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes Relaxation-inspired Masked Diffusion (RMD) for crystal generation. Crystals are serialized into structural text containing composition, lattice parameters, atomic sites, and symmetry information, and a bidirectional network is trained to reconstruct masked tokens. The main methodological component is an inference-time token-selection and revision strategy. Candidate log probabilities computed from Gumbel-perturbed logits determine which positions remain masked or are remasked, allowing previously generated content to be reconsidered as the visible context evolves. The analogy to physical relaxation concerns this repeated assessment and updating procedure; the sampler does not explicitly evaluate energies or forces. Experiments cover de novo crystal generation and composition-conditioned crystal structure prediction. The reported results show improvements in validity and the yield of stable structures over a masked-diffusion baseline with random position selection, competitive structure-prediction performance, and fewer subsequent CHGNet relaxation steps than the evaluated baselines.
Critical strengths
This paper firstly try the discrete mask-based diffusion language model for crystal generation. It proposes a atom-wise correction method in sampling.
Critical weaknesses
-
The physical-relaxation analogy is weakly justified, and Figure 1 provides limited technical insight. I find Figure 1 largely schematic: it illustrates the general distinction between autoregressive generation and bidirectional revision, but provides little explanation of the proposed mechanism. The actual selection score is derived from Gumbel-perturbed token probabilities, with no demonstrated relationship to physical energy, forces, stress, or geometric errors. An actual refinement trajectory would be more informative.
-
The representation and implementation are insufficiently specified. The manuscript describes preprocessing, tokenization, decoding, and postprocessing through abstract mappings, but does not provide enough detail about numerical precision, structural ordering, canonicalization, or malformed-output handling. The advantages and potential information loss of representing numerical geometry through text tokens are also insufficiently evaluated. Missing architectural and training details further limit reproducibility and make it difficult to assess how much performance depends on representation and postprocessing choices.
-
The computational-efficiency evidence is incomplete. Fewer downstream CHGNet relaxation steps are encouraging, but they do not establish lower computational cost for the complete pipeline. RMD requires repeated language-model evaluations, yet the numerical sampling budget, runtime, throughput, and combined generation-plus-relaxation cost are not reported. Table 2 also omits the MD baseline, making it difficult to attribute the reduced relaxation requirement specifically to the proposed selection strategy. Energy-change units, evaluated sample counts, and failure handling require clearer reporting.
Questions for authors
-
Can the authors provide a complete, reproducible structure-to-token-to-structure example? Please specify all pre-postprocessing or repair operations, and identifying which components are learned. What encoding–decoding error does the representation introduce, and what benefit does textual tokenization provide for geometric modeling?
-
What is the complete computational cost of obtaining useful candidates?
-
Why is confidence in a proposed token an appropriate criterion for retaining a potentially different existing token? Equation (10) scores a newly proposed token, whereas Equation (11) can use that score to retain an existing token that differs from the proposal.