- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper presents a language model agent for inorganic crystal discovery that integrates materials retrieval, structure generation based on Wyckoff representations, elemental substitution, novelty checks, stability assessment, and band gap prediction into a multi-turn interactive environment. The authors first perform supervised fine-tuning of Qwen3.5-4B using approximately 1,100 trajectories generated by Gemini 3.1 Pro, then optimize its search policy through GRPO-style reinforcement learning. The reward accounts for validity, stability, novelty, property constraints, and duplicates both within each group and among previous submissions.
The experiments cover composition-conditioned generation on MP-20 and WBM, unconditional generation, band gap-conditioned generation, and lead-free perovskite search. Under a stability threshold that allows metastable structures, RL increases the S.U.N. rate on composition-conditioned tasks from approximately 11% to approximately 20%, approaching the teacher model’s performance. The authors also evaluate candidates using an MLIP that was not used during training and perform DFT calculations on selected candidates.
This work demonstrates the potential of training small models to carry out materials search workflows. However, the current evidence more strongly supports the conclusion that RL improves how the tool budget is used; it remains insufficient to establish that the agent has learned a more effective materials discovery strategy at the same computational cost. The numerical specification of the reward function, the comparability of the DFT validation, and the evaluation protocol for property-conditioned generation also require further clarification.
Critical strengths
-
The authors formulate crystal generation as a sequential decision-making process in which the agent reads computational feedback, modifies candidates, and decides when to stop. The tool interfaces cover key operations in materials search, and the Wyckoff representation is well suited to language models’ handling of crystal symmetry. Training a 4B model to carry out this workflow has practical value.
-
Table 4 shows that, under the threshold () eV/atom, the S.U.N. rate increases from 11.4% to 20.5% on ID tasks and from 11.5% to 20.1% on OOD tasks. These results support the conclusion that RL improves the agent’s overall behavior, with gains extending beyond the training compositions. However, this strength is primarily evident under an evaluation threshold that permits metastable structures.
Critical weaknesses
-
Section 7 shows that RL increases the number of stability evaluations per episode from 2.8 to 6.8. Figure 5 further shows that, under the same evaluation budget, SFT with repeated sampling and filtering can match RL’s metastable S.U.N. rate and performs better at (). The “nearly twofold” improvement at the episode level therefore cannot be directly interpreted as an improvement in search efficiency. Integrating search into a single episode has engineering value. However, the paper does not report end-to-end latency, generated token counts, or computational cost per unique discovery, and it lacks comparisons with simple search controllers under a fixed budget. The stopping-behavior analysis in Figure 6 primarily provides correlational evidence and does not establish that the model has learned a more effective strategy for revising candidates.
-
The paper introduces within-group credit sharing, a structural uniqueness reward, a penalty for duplicates of previous submissions, and a penalty for known stable compositions, without separately testing their necessity. In the unconditional task, in particular, 3,237 stable samples correspond to only 318 distinct structures, yielding a final S.U.N. rate of 3.0%, below PLaID++’s 7.7%. This result does not imply that the diversity rewards are entirely ineffective, but it leaves their effectiveness and scope unresolved. Moreover, using “chemical formula + space group” as the identifier for some duplicate penalties may incorrectly classify distinct polymorphs with the same composition and space group as duplicates. Within-group diversity, diversity across episodes, and actual structural diversity should be distinguished.
Questions for authors
Could you separately remove (, (), the historical duplicate penalty, and the known-composition penalty, and report the cumulative number of unique discoveries in both conditional and unconditional tasks? How do you prevent the “chemical formula + space group” identifier from incorrectly penalizing distinct polymorphs?
3 comments
As the discussion period is coming to an end, we wanted to check if our response has addressed your concerns. In particular, we added a fixed-budget comparison between SFT and RL, a reward ablation, and a StructureMatcher check of the formula + space group duplicate identifier. Let us know if you would like any other clarification.
The responses addressed my main concerns and I have raised the scores accordingly.
Thank you for your comments. In this rebuttal, we ran the two additional experiments, a fixed-budget comparison and a reward ablation, and answer each point below. Additionally, we retrained the agent on episodes from Gemini 4 Argon instead of Gemini 3.1 Pro, following the same procedure, and the results below use the retrained SFT and RL models. We use this model hereafter.
Budget vs. better search
We capped the RL agent's stability evaluations at 3, 4 and 6 on the out-of-domain task, and compared it with SFT sampled repeatedly until it has used the same number of evaluations. The table gives the distinct stable and novel structures found per prompt (E_hull < 0.1 under both Orb-v3 and eSEN).
With few evaluations RL finds more than SFT (+0.37 ± 0.17 at a cap of 3), and the two are within noise at 4 and 6. Candidate quality (13.9% of evaluated candidates are stable and novel) and submission accuracy (about 72%) are the same for both. The gain comes from a larger search that the agent has learned to direct: it keeps evaluating while its candidates are unstable and submits once it holds a stable one (Figure 4c in the revised paper). Uncapped, RL spends about 12% fewer tokens per discovery (259k against 293k).
Reward ablation
One RL run takes four to five days on our 8 A100 GPUs, so on the retrained agent we removed all our diversity additions in a single run instead of one at a time. Each episode is scored on its own, with no diversity term, shared credit, history, or repeat notice. The known-composition penalty is kept in both runs. The table gives the distinct S.U.N. structures found over 800 episodes per task under the consensus of Orb-v3 and eSEN (rate in parentheses).
Our reward finds a few more distinct structures when the composition is fixed, and 2.5 to 4.7 times as many on the unconditional task, where the plain agent keeps resubmitting the same ones. The unconditional rates here are over 800 samples and are not comparable with Table 1, where uniqueness is counted over 10,000. That comparison is running and will go in the paper.
Polymorphs.
Our reported uniqueness and novelty compare full structures with StructureMatcher. Formula + space group is only used during training, to penalize repeated structures. To see how often it wrongly merges polymorphs, we re-checked every pair it flags as a duplicate with StructureMatcher.