- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper introduces AlphaGrammar, a learned molecular graph tokenizer, and Gramole, a language model that processes text and molecular grammar rules within a shared token sequence.
Critical strengths
- The sequential grammar should provide a useful interface between molecular graphs and autoregressive language models.
Critical weaknesses
-
Writing / Motivation. Overall, this paper is very difficult to follow and requires lots of background knowledge—too many concepts without clear explanations or even without references. I spent more than half a day understanding it; however, I still have many unclear parts. 1.1. The authors think SMILES and SELFIES are "(i) syntactically brittle, (ii) chemically unintelligible, and (iii) disrespectful of permutation invariance because there can be up to exponential DFS traversals on the same graph topology". It's very unclear to me why. There are no refs, no evidence, no explanations to support these so strong claims. And I don't think these are common agreements of the community that do not need explanations. 1.2. The authors think "An ideal MGT should (i) compose a modular vocabulary that an LLM can easily enforce chemical validity, (ii) build an interpretable vocabulary of chemically meaningful rules and (iii) encode and decode arbitrary molecules losslessly into a canonical sequence of tokens, without heuristics that violate graph invariances (e.g. SMILES canonicalization)." Again, it's very unclear to me: what is the evidence to indicate that "an LLM can easily enforce chemical validity"?
-
I'm totally lost in Section 3. 2.1. I don't understand the correlation between each step. Are they related or randomly listed here? 2.2. Why should RL be introduced after finalizing the optimization objectives? Is RL a post step after optimization? Also, what is the reward function of RL? "Appendix C gives the complete objective and reward definitions." But I don't find anything in Appendix C. 2.3. I don't see a clear correspondence between Section 3 and Figure 3.
-
Experiments 3.1. Why is Figure 5 placed in Section 6? 3.2. Where are the "Full results in App. J."? 3.3. Please also clarify how the subsets in Tables 21–22 relate to the full evaluation population.
Minor:
- Why do we need the DMTA abbreviation in the Abstract? Is it an important abbreviation?
- Incorrect citation format. Please distinguish \cite vs. \citp in the ICLR template.
Questions for authors
As listed in Critical Weaknesses
Dear Reviewer 9Qqt
Thank you for recognizing the novelty of our representation and the extensive ablations!
[W1] "The central guarantees are weaker than claimed. The vocabulary is said to hold around 50M atomic rules, so no molecule is out of vocabulary, but embeddings exist only for rules seen in training, about 9.6k atomic rules on MolQA. A rule that is in the symbol set but never seen in training has an untrained embedding, so for the model, it is effectively out of vocabulary. The guarantee is about which symbols exist, not about learned representations."
Your insight is very sharp! But these are two different claims, and we'd like to disentangle them with you. Theorem 1 closes the vocabulary: a finite, enumerable rule set covers every reasonable molecule, so there is no molecule for which the tokenizer has no symbol. It is a guarantee about symbols, as you said. Whether a particular rule's embedding has received gradient is a representation learning problem. We see this as a strength, not a weakness, because closing the vocabulary is what makes the representation-level question bounded and answerable at all.
The alternative of an open vocabulary carries no guarantees at all. With an open vocabulary the number of graph tokens unseen in training is unbounded, and each one can differ in topology from anything seen during training to an unbounded degree. An adapter has to embed them anyway, with no guarantee about what it returns. That cost is visible in the method we compare against: mCLM's block vocabulary is filtered to the 1,000 most frequent blocks (Edwards et al., 2025). Its training set is restricted to only a small fraction of ChEMBL drugs that their tokenizer fully covers. On that filtered set, 120 of the 122 drugs in their benchmark test set contain at least one block outside the vocabulary. Our design closes the vocabulary and drops the adapter so that rule tokens are learned natively as tokens. The alternative is to keep an adapter and ask it to embed out-of-distribution tokens with no guarantee at all.
Combining our type-chaining system with the closed vocabulary is what makes "effectively out of vocabulary" lose its teeth. On the mCLM corpus, 3.9% of the distinct rules the validation split exercises have untrained embeddings because they appear in no training example (our Q1 response below contains more details). Those "effectively out of vocabulary" rules can still be emitted and consumed normally. What makes them usable is not a trained embedding, but the inference type-chaining system we developed that arises from the grammar's symbolic properties. Decoding is masked to rules that type-chain with the derivation so far, so an untrained rule can still be predicted if the mask leaves it as the only legal continuation. These rows don't start from noise: each is initialized from the mean of the trained embedding table rather than at random. We would rather let the benchmark results and our "extensive ablations" (more below) carry the rest of our argument.
We want to make the symbolic and representation claim separation clear. We are tightening one sentence in Section 2, where we write that a closed vocabulary removes the exposure to graph tokens unseen in training. What closure removes is out-of-vocabulary tokens, and the sentence now says that. The sentence after it already stated the representation-level fact, that a rule's embedding is learned as the rule is used, so the materialized table grows with the rules actually encountered.