- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper discusses an interesting problem: generating crystal structures in few steps through generative models. To achieve this goal, the paper proposes Composition-conditioned Moment matching for Material generation (CoMMAT). At a high level, CoMMAT trains a causal Transformer on a ground-truth posterior distribution by minimizing the KL divergence, and the sampled latent variables are fed into a lattice predictor that generates a lattice structure. Lastly, conditioned on this fixed lattice structure, it uses inductive moment matching (IMM) and CSPNet to generate the remaining coordinates.
== post rebuttal ==
Thank you for the thorough response to my concerns. However, I choose to maintain my score. The reason is that I feel my first concern (W1) remains, although the authors did answer my question on what the compute and performance tradeoff would look like for FLOPs. I understand where the authors’ motivation comes from; it is generally the case that we want more efficient generative models across various application domains, but I feel the means to achieve the authors’ claimed “extreme few-step generation” is through assuming a fixed lattice structure (W3) is a bit strong, as the authors have acknowledged.
Critical strengths
The paper proposes to use a single lattice predictor in place of performing multi-step generation on the lattice structure, which saves the number of forward passes in CoMMAT. The experiments conducted are also thorough, and ablations are performed on the design choices of the paper.
Critical weaknesses
- There seem to be a lack of motivation on why we need to perform few neural function evaluations (NFEs) on crystal generation task. It seems that the only sentence explaining the motivation in introduction is “For high-throughput screening, however, generation itself must be inexpensive.” without any relevant reference or explanations for such a motivation. This naturally raises the question of why we need CoMMAT in the first place, which is an important question to ask. The paper also aims to obtain good performance in 2-8 NFEs, but it didn’t say how much resources are being used for each NFE such as FLOPs or time consumption. Without this relevant information on marginal improvement of performance given costs, it becomes difficult to evaluate whether we can just apply existing methods using more NFEs while having higher-quality generation or whether we should use CoMMAT to save the cost.
- One central assumption in CoMMAT’s design is that a fixed lattice structure suffices for crystal generation task, and ablation studies in Table 3a does establish that a lattice predictor with a single forward pass even outperforms iterative approaches when using 32 NFEs. However, similar to (1), I do not know whether such benefits are meaningful since I do not have information about the tradeoff between performance and costs of the NFEs. If each NFE is cheap or affordable, I don’t see why we can’t run more NFEs with an iterative lattice predictor to improve performance, so more demonstration on the motivation would address this concern.
- I am uncertain whether the assumption that a fixed lattice structure suffices is a reasonable assumption. At first glance, I feel it is not a weak assumption, but it is also somewhat flexible since it assumes a fixed structure for a given latent variable. I am not an expert on crystal lattices, so I will leave this question to the other reviewers.
I will consider raising my rating if (1) and (2) are properly addressed.
Questions for authors
- Section 4.1 mentions that two paths are used together (one from p and the other from q) for the lattice predictor, I wonder how are they fed to the predictor?
- Section 4.2 mentions y, but I do not seem to be able to find how y is defined.
3 comments
W2. Why use one-shot lattice prediction instead of iterative lattice refinement?
Our motivation is to decouple global lattice geometry from atomic-coordinate refinement. CoMMat first predicts the lattice from the composition-conditioned structural latent, , and subsequently refines atomic coordinates within this fixed periodic cell. This provides a consistent lattice geometry throughout coordinate refinement and allows the iterative decoder to focus on atomic arrangements.
We agree that additional lattice evaluations can be affordable and may improve structural quality. To investigate this, we evaluated one-shot prediction, decoupled iterative lattice generation (IMM/Flow), and joint lattice–coordinate refinement across multiple sampling budgets.
Lattice ablation on MP-20 (CSP match rate %, three sampling seeds):
| Lattice configuration | 2 NFE | 8 NFE | 32 NFE |
|---|---|---|---|
| One-shot CoMMat | 42.1 | 50.8 | 51.65 |
| Decoupled Lattice-IMM (+4 lattice NFE) | 41.1 | 44.7 | 45.3 |
| Decoupled Lattice-Flow (+8 lattice NFE) | 41.5 | 44.4 | 44.9 |
| One-shot, without decoupled type training | 28.9 | 31.8 | 32.6 |
| Joint lattice–coordinate refinement, without decoupled type training | 17.5 | 17.9 | 18.0 |
The upper three rows compare lattice objectives in the final CoMMat training setting. The lower two rows compare joint refinement against its matched type-training control. The joint variant additionally uses fractional-coordinate transport.
Computational cost. The extra lattice evaluations require only 0.003–0.007 GFLOPs per structure, compared with 1.44 GFLOPs for one CoMMat coordinate evaluation. At 8 coordinate NFE, measured sampling times are 23.0/23.3/23.1 seconds per 10,000 structures for one-shot/IMM/Flow, respectively. Thus, lattice refinement is inexpensive; CoMMat's primary computational savings arise from reducing expensive coordinate evaluations, not from eliminating lattice evaluations.
Performance. Neither decoupled iterative alternative consistently improves accuracy over one-shot prediction. Joint lattice–coordinate refinement performs substantially worse than its matched one-shot control (by 11.4–14.6 percentage points across 2–32 NFE). Although the joint variant also differs in coordinate representation, an independent representation ablation changes MR by at most 0.6 points. These findings suggest that simultaneous lattice–coordinate refinement is not automatically beneficial in our evaluated formulation.
Therefore, our results support one-shot lattice prediction as a simpler and competitive architectural choice, rather than demonstrating that iterative lattice refinement is universally unnecessary.
W3. Is the fixed-lattice assumption reasonable?
The lattice is fixed within each coordinate-refinement trajectory, not across all generated crystals. In CoMMat, . During de novo generation, sampling permits different lattices for the same composition. In CSP, using the conditional-prior mean produces one predicted lattice per composition.
This factorization simplifies coordinate generation by maintaining consistent periodic geometry, but introduces an important limitation: coordinate refinement cannot correct errors in the initially predicted lattice.
We quantified this limitation through a ground-truth-lattice oracle experiment. On MP-20, the predicted lattice has a median cell-volume error of 3.6%, with 84% of predictions within 10% of the reference volume. Under the corrected validity-gated scorer, replacing the predicted lattice with the ground-truth lattice increases CSP match rate from 42.1% to 54.8% at 2 NFE, 50.8% to 59.9% at 8 NFE, and 51.65% to 60.5% at 32 NFE. These results demonstrate that lattice prediction is a substantial remaining bottleneck that additional coordinate refinement alone cannot resolve.
The limitation is especially relevant for polymorphic compositions, where multiple distinct unit cells may be valid. Although a sampled structural latent permits lattice diversity in de novo generation, the deterministic prior-mean lattice used in CSP cannot explicitly represent multiple cells for the same composition.
Thus, one-shot lattice prediction is a deliberate architectural tradeoff, not an assumption that a fixed lattice is universally sufficient. Our experiments support its effectiveness in the evaluated few-step setting, while identifying more accurate, polymorph-aware lattice prediction and improved joint lattice–coordinate modeling as promising directions for further improvement.
Questions for Authors
Q1. How are the two latent paths fed to the lattice predictor?
The two paths are processed separately through the same shared lattice predictor. During training, and independently produce predicted lattices and coordinate outputs. Each path contributes its own structural loss, combined with . The latent vectors are neither concatenated nor averaged. During inference, only the composition-conditioned prior path is used. We have clarified this in Section 4.1.
Q2. How is y defined in Section 4.2?
It is the six-dimensional lattice regression target:
where a,b,c represent lattice lengths, represent lattice angles, and N is the atom count. The six components are subsequently standardized using training-set statistics. We have added this definition directly to Section 4.2.
We thank the reviewer again for the constructive suggestions. We hope the additional computational analysis and lattice-refinement experiments directly address concerns (1) and (2), and we would appreciate reconsideration of the rating.
W1. Motivation for few-step crystal generation and computational cost–quality trade-off
We thank the reviewer for this important observation. We agree that the motivation for few-step crystal generation should be supported by quantitative computational evidence rather than NFE alone. We address both the motivation and the trade-off between generation quality and computational cost.
Motivation. Recent crystal generators, including FlowMM, CrysBFN, SymmBFN, Crystalite, and ZAtom-1, increasingly emphasize sampling efficiency alongside generation quality. For example, FlowMM reports approximately 3× fewer integration steps, while CrysBFN reduces network evaluations by 200× relative to diffusion-based methods. This is particularly relevant to high-throughput materials discovery, where many generated candidates are discarded during screening for structural validity, thermodynamic stability, novelty, and desired properties, making large candidate pools necessary. Efficient generation reduces the computational cost of exploring these pools under limited resources. Motivated by this need, we investigate the extreme few-step regime (as few as 2 coordinate evaluations) to determine whether competitive crystal generation quality can be maintained at substantially lower computational cost.
We will strengthen the Introduction with this motivation and explicit compute–quality comparisons.
Computational cost per NFE. We agree that NFE alone is insufficient for comparing computational efficiency, as different architectures incur different costs per evaluation. We therefore measured FLOPs using the same profiling procedure across models and generation time for 10,000 de novo structures on a single NVIDIA A30 GPU (FP32).
For CoMMat, s/NFE represents incremental decoder time over 10,000 samples; baseline values are native-budget runtimes divided by NFE. CoMMat's DNG totals include fixed generation overhead (~0.8 GFLOPs/structure). Thus, timing definitions are not strictly identical.
Both CoMMat variants require fewer GFLOPs per evaluation than the evaluated baselines. CoMMat-512 requires 1.44 GFLOPs/NFE, compared with 2.30 for FlowMM and 3.56 for CrystalFlow, representing approximately 37% and 60% lower computational cost per evaluation, respectively.
Quality–cost trade-off. To directly address whether existing methods can achieve better quality using additional evaluations, we compare MP-20 CSP match rates against computational cost. Unlike the DNG totals above, these CSP costs exclude composition-generation overhead.
Low-compute performance. At 2 NFE, CoMMat-512 achieves a higher match rate (42.1%) than FlowMM (40.3%) and CrystalFlow (29.2%), while requiring 37% and 59% fewer GFLOPs, respectively. CoMMat-256 further reduces computational cost to only 0.8 GFLOPs/structure while maintaining a comparable 41.9% match rate. At 4 NFE, CoMMat-512 achieves 49.3% MR at 5.8 GFLOPs, approaching CrystalFlow's 50.5% at 14.2 GFLOPs. Notably, CoMMat-512 at 8 NFE achieves 50.8% MR at 11.5 GFLOPs, slightly exceeding CrystalFlow at 4 NFE (50.5%) while requiring approximately 19% less compute.
Marginal quality–cost trade-off. Increasing CoMMat-512 from 2 to 4 NFE improves match rate by 7.2 percentage points while doubling computational cost, whereas increasing from 4 to 8 NFE yields only 1.5 additional points. CoMMat-256 similarly improves from 41.9% to 46.1% across 2–8 NFE while requiring only 0.8–3.0 GFLOPs/structure. These results demonstrate diminishing returns from additional evaluations. Although FlowMM and CrystalFlow achieve higher absolute accuracy at larger budgets, CoMMat provides competitive structural quality at substantially lower computational cost, particularly in the extreme few-step regime.
Therefore, CoMMat offers a favorable quality–cost trade-off under constrained computational budgets, rather than universally outperforming higher-budget methods.