A sequence of symbols, followed by the same symbols in reverse, contains no measured solubility, binding affinity or quantum energy. Yet learning its internal relationships can leave a molecular prediction model better prepared for its eventual job. In a September preprint, Moritz Friedemann and colleagues test that proposition with an unusually informative sequence of controls. Their strongest result comes after the model has subsequently trained on real molecular strings: a reversal exercise still improves prediction of lipophilicity.1
The interesting finding is therefore about preparation. This is an unreviewed computational study of how a model is initialized, rather than a demonstration of discovering a useful compound. Its value lies in separating several explanations for better predictions: additional training, familiarity with chemical-looking syntax, the structure of the practice task, and the amount of labelled chemistry available afterwards. Those distinctions turn a modest benchmark improvement into a useful research question.1
Three stages, three different sources of information
The foundation is MoLFormer, a transformer that reads SMILES molecular strings. Earlier work by Jerret Ross and colleagues established this approach by pretraining on unlabelled molecules and then adapting the representation to property datasets. The original paper distinguishes PubChem-only models from MoLFormer-XL, trained on approximately 1.1 billion PubChem and ZINC molecules. That history matters: the architecture offers a way to learn from molecular syntax before property labels become available, but its variants do not all have the same training history.2
Friedemann and colleagues put an additional stage in front of that familiar pipeline. First the model learns a generated, nonmolecular task. Next it undergoes masked-token training on 250,000 PubChem molecules for 12 epochs. Finally it is fine-tuned to predict a molecular property. The principal comparison holds the molecular data and the subsequent training settings fixed, changing whether the starting weights came from procedural practice or random initialization. It therefore tests an added preparation stage under a controlled molecular-training budget; it does not establish equal total computational cost.1
Five practice tasks give that comparison substance. Reverse presents a string and its reversal. Dyck generates properly nested brackets, while Dyck-Shuffle allows crossing bracket dependencies. A shortest-path task asks for distances through a generated graph represented in a molecule-like string. A neural cellular automaton supplies evolving spatial patterns. Each becomes a masked-token problem, so the underlying prediction machinery remains comparable even though the information being learned differs.1
There is also a useful precaution against a trivial interpretation. During procedural training, the token embeddings remain fixed at their random initialization; the task-specific output head is discarded afterwards. The transferred object is the transformer backbone. The experiment is consequently not just teaching a chemical token a favourable numerical value and carrying that value forward. It asks whether processing relationships among symbols changes how the network later learns from chemistry.1
Read the error before the percentage
The main table reports mean absolute error on standardized targets. For Lipophilicity, the molecular-only baseline is 0.4083, with a reported spread of 0.0125, against 0.3885 with a spread of 0.0111 for Reverse. The QM9 energy-gap experiment, using a 1,000-molecule training subset, moves from 0.2662 to 0.2611. These are comparisons within each benchmark. The standardized values should not be read as errors in physical energy units, nor compared across endpoints as if they measured the same chemical difficulty.1
The distinction is practical. A smaller standardized error establishes an improvement in that prediction exercise, but does not directly tell a chemist how much closer an individual predicted property lies to its laboratory value. Appendix A states that the standardization statistics come from the training split and that test evaluation uses the checkpoint with the lowest validation error. Those details make the reported comparison more interpretable than an isolated headline percentage.1
FreeSolv is an important counterweight. Reverse has a lower mean error there too, 0.1621 against 0.1676, but the authors do not regard the dataset as providing a clear benefit. Four other procedural tasks worsen the mean. That is a useful restraint: the study does not establish a universal recipe across the three regression endpoints. A method can improve one well-defined benchmark and remain unresolved on another.1
The headline comparisons use three downstream fine-tuning seeds, increased to six for FreeSolv. Appendix A makes a narrower point than the phrase “multiple runs” might suggest: each procedural and molecular pretraining is itself a single run with the same fixed seed. The repetitions therefore probe downstream sensitivity, including the sampled QM9 training subset, rather than the variability of the entire training pipeline. Replicating the pretraining stages would help establish how stable the initialization benefit is; its absence does not erase the comparison actually performed.1
A chemical resemblance is not the whole explanation
Nested brackets and graph distances appear intuitively closer to molecular strings than reversing a sequence. That intuition does predict part of the learning curve. The structurally aligned tasks initially help masked-token learning on PubChem. Their early advantage fades, however, and the shortest-path initialization eventually becomes detrimental by that metric. Reverse supplies the strongest downstream result despite its less obvious chemical resemblance.1
This is one of the paper's most useful distinctions. Being quicker to learn the syntax of the next training corpus is not necessarily the same as learning a representation that best predicts its eventual properties. The experiment does not identify a universal structural ingredient for transfer, but it undermines the easy assumption that the most chemically suggestive pretraining task must be the most useful one.1
The shuffled-token controls make the case stronger. Randomly permuting tokens inside each generated sequence preserves its length and token counts while disrupting order-dependent relationships. In direct transfer to Lipophilicity, the advantage disappears across all five tasks. In the full three-stage pipeline, a shuffled Dyck-Shuffle control reaches an error of 0.4181, worse than the molecular-only baseline, while structured Dyck-Shuffle reaches 0.3937. This is evidence against marginal token statistics or generic exposure to extra sequences being sufficient explanations.1
It is also a properly bounded control. The full molecular-pretraining test uses Dyck-Shuffle as its representative shuffled condition; it does not repeat the entire three-stage ablation for every task. The broader five-task evidence comes from the simpler setting without molecular pretraining. Keeping those experiments separate preserves the strength of each result without quietly extending either one.1
The best practice session can end before mastery
Much of the mechanistic analysis removes the intermediate molecular stage. Procedural weights go directly into downstream fine-tuning and are compared with random initialization. This diagnostic setting is valuable because it isolates what survives from the practice task, but its larger or differently shaped improvements are not interchangeable with the main three-stage benchmark.1
In that setting, the authors vary the amount of labelled QM9 training data while keeping a common held-out test set. Dyck pretraining helps more as the available training set becomes smaller. The full-data endpoint is based on a single seed, unlike the repeated smaller-set points. The result supports the interpretation that procedural practice supplies a useful starting bias when supervision is scarce, while leaving the exact size of that advantage dependent on the evaluation regime.1
Increasing the practice budget brings another surprise. For four of the five task families, the downstream benefit peaks before the procedural objective is mastered and then deteriorates. The cellular-automaton task is the exception, and it is also the task the model does not learn to solve. Appendix C connects downstream performance with the remaining procedural loss, including the irreducible uncertainty in Dyck-Shuffle. This is a more informative analysis than simply asserting that longer training causes overfitting: it links transfer to how close the model comes to the particular task's attainable solution.1
A reporting detail matters at the highest budgets. The Figure 4 caption says that some seeds collapsed to the loss of a constant predictor and were excluded from the mean. Those averages therefore do not represent all attempted runs. A prospective user would need both the retained accuracy and the frequency of such failures to assess reliability. This qualification concerns the high-budget sweep; it should not be used to imply that the main-table comparison excluded failures on the same basis.1
The selection procedure also remains part of the cost. Appendix B uses a validation grid over task complexity and training duration. That is preferable to choosing settings from test results, but it means that the useful stopping point is learned with downstream feedback. The paper itself leaves open whether procedural learning curves alone could identify when to stop. A cheap winning run is consequently not yet the same thing as a cheap, generally applicable selection strategy.1
Where the transferable information survives
Selective weight transfer adds a final layer of explanation. For Dyck, Dyck-Shuffle and Reverse, retaining attention-layer weights can match or outperform retaining the full backbone. Transferring feed-forward weights alone generally loses most of the benefit. The shortest-path task behaves differently: neither component alone recovers the full-transfer result. These comparisons support a task-dependent location of useful information, rather than a claim that one component is always responsible for transfer.1
Attention-only transfer also makes some tasks more resistant to excessive procedural training. Dyck and Dyck-Shuffle retain useful effects at larger budgets, whereas Reverse and shortest-path transfer still eventually lose their advantage. The authors reasonably interpret this as evidence that some over-specialization resides in the feed-forward layers. The remaining deterioration shows why that interpretation should remain partial: discarding those weights is not a universal cure.1
For molecular discovery, the study's strongest contribution is an experimental argument for treating initialization as a design choice. Structured nonmolecular practice can help under a fixed subsequent molecular-training regime, and carefully chosen controls make that result harder to dismiss as extra token exposure. The next useful test is whether a selection rule transfers to another property dataset without a fresh search for the winning practice task and stopping point. That follows directly from the validation dependence and endpoint variation already visible here.1
The paper earns attention for making its favourable result investigable. It provides task-generation rules, training details, controls that break structure while retaining surface statistics, and component-level interventions. Those are concrete strengths. Its evidence supports a promising way to prepare a molecular learner, with the practical value still determined by downstream data, task choice and training budget—not by how perfectly it can reverse a string.1
What this does not establish
- Unreviewed preprint; computational experiments were inspected but not reproduced.
- Main comparisons cover three regression endpoints and one architecture, with one pretraining seed and repeated downstream fine-tuning.
- Mechanistic sweeps mostly omit molecular pretraining; high-budget Figure 4 excludes collapsed seeds.
- Task complexity and duration are selected using downstream validation; total selection cost and prospective generality are not established.
Claims and evidence
Structured procedural pretraining improves Lipophilicity and small-set QM9 in a controlled three-stage pipeline; FreeSolv remains inconclusive. Sections 3–4.1, Table 1. 1
Embeddings are fixed during procedural training and the procedural head is discarded; transfer occurs through the backbone. Section 3, Appendix A. 1
Reported test errors use training-split standardization and validation-selected checkpoints; pretraining uses one seed, downstream runs three or six. Appendix A. 1
Shuffling removes benefits across five tasks in two-stage tests; full three-stage control uses Dyck-Shuffle. Section 4.2.4 and Appendix D. 1
Scarcity and budget sweeps are diagnostic settings; full QM9 point is single-seed and Figure 4 excludes collapsed runs. Sections 4.2.2–4.2.3, captions. 1
Task configuration selection uses downstream validation; attention-only results depend on task. Appendix B and Section 4.3. 1
MoLFormer introduced molecular masked-token pretraining; original paper distinguishes PubChem-only from 1.1B PubChem+ZINC XL variants. Main and Appendix E. 2
References
Moritz Friedemann; Zachary Shinnick; Philip Torr; Bruno Andreis. Procedural Pretraining for Molecular Property Prediction. arXiv; 2026; Unreviewed preprint, version 1. DOI: 10.48550/arXiv.2609.17831. Accessed 2026-09-19.
Source evidence and access
Sections 3–5; Table 1; Figures 3–6; Appendix A Tables 2–3, Appendix B Figure 7, Appendix C Table 4, Appendix D Figure 8
Full text and Appendices A–D inspected. Table 1 reports standardized test MAE 0.4083 ± 0.0125 versus 0.3885 ± 0.0111 on Lipophilicity, and 0.2662 ± 0.0015 versus 0.2611 ± 0.0004 on QM9 gap (1k), baseline versus Reverse. Appendix A states three fine-tuning seeds (six for FreeSolv), one pretraining seed, training-split standardization, 400 QM9 fine-tuning epochs. Fig. 4 excludes collapsed high-budget runs. Appendix B selects task budgets by validation performance. Full source snapshot saved locally; experiments not reproduced.
Full-text access verified. Full version-1 HTML with complete Appendices A–D accessed 19 September 2026; CC BY 4.0. Local snapshots lin-procedural.html and lin-procedural.txt.
Jerret Ross; Brian Belgodere; Vijil Chenthamarakshan; Inkit Padhi; Youssef Mroueh; Payel Das. Large-scale chemical language representations capture molecular structure and properties. Nature Machine Intelligence; 2022; 4; (12); 1256–1264; Peer-reviewed journal article; author preprint v3 inspected for full text and supplements. DOI: 10.1038/s42256-022-00580-7. Accessed 2026-09-19.
Source evidence and access
Publisher bibliographic header; author version Main, MoLFormer Framework; Appendices B, C and E
Publisher metadata verified; lawful full author version https://arxiv.org/html/2106.09553v3 inspected, including relevant supplement sections B, C and E. MoLFormer-XL uses 1.1 billion molecules; Appendix E distinguishes PubChem-only (111M) and PubChem+ZINC (1.1B) models. Appendix C describes random regression splits and regression dataset endpoints. No reproduction performed.
Publisher bibliography and lawful full author manuscript v3, including relevant supplementary methods B/C/E, accessed 19 September 2026. Local snapshots lin-molformer.html and lin-molformer.txt; published full text subscription restricted.
Publication record
Published 19 September 2026. Version abdafecf-6705-484e-8d51-54432e0d0b69. Version created 19 September 2026.
- 19 September 2026 · Published version abdafecf · Viewing this version
This version passed an independent AI source and claims review and was approved by the AI editor. This is editorial review, not academic peer review.

