Improving the reliability of molecular string representations for generative chemistry
Notice bibliographique
Résumé
Abstract Generative modeling for chemistry has advanced rapidly in recent years, but this surge in popularity raises a foundational question: which molecular representation is best suited for modern machine learning models? Despite not being designed for generative tasks, SMILES remain the most commonly used string-based representation. However, while SMILES follow strict syntactic rules, grammatically correct SMILES strings do not always correspond to valid molecules. SELFIES were introduced as an alternative that addresses this limitation by ensuring that every string of SELFIES tokens represents to a valid molecule. In this study, we comprehensively evaluate the limitations of both SMILES and SELFIES as representations for generative models. We define two key criteria for robust molecular generation: viability, generated strings represent novel, unique molecules with correct valence, and fidelity, the distribution of physicochemical properties from sampled molecules resembles that of the training data. We find that approximately one-fifth of molecules generated using canonical SMILES are invalid, failing the viability criterion. In contrast, all SELFIES-generated molecules are viable, but they deviate significantly from the training distribution, indicating low fidelity. To address these limitations, we develop data augmentation procedures for both representations. While simplifying the SELFIES grammar yields only modest gains in fidelity, our stochastic augmentation method for SMILES, ClearSMILES, significantly improves both viability and fidelity. ClearSMILES simplifies syntax by reducing the vocabulary size and explicitly encoding aromaticity via Kekulé SMILES, making it easier string representations for models to process. Using ClearSMILES, the rate of invalid samples decreases by an order of magnitude, from 20% to 2.2%, and fidelity to the training distribution is also moderately improved. Generative chemistry has seen rapid development recently. However, models based on string representations of molecules still rely largely on SMILES 1 that have not been developed for this context and SELFIES 2 who were introduced to reduce those problems. The goal of this study is to first analyze the difficulty encountered by a small generative model when using SMILES and SELFIES. Our study found that SELFIES and canonical SMILES 3 are not fully reliable representations for a small generative model, i.e. do not ensure concurrently the viability and fidelity of samples. Viable samples represent novel, unique molecules with correct valence, while fidelity is efficient distribution learning of key physico-chemical properties. 4 In fact, 20% of the samples generated using canonical SMILES input representation do not correspond to valid molecules. In contrast, samples generated using SELFIES were all viable but where not able to reproduce as well the distribution of physico-chemical properties as SMILES. As a mitigation strategy for the previously identified problems, we have developed data augmentation procedures for both SELFIES and SMILES. Simplifying the complex syntax of SELFIES yielded only marginal improvements in string stability and overall fidelity to the training set. For SMILES, we developed a stochastic data augmentation procedure called ClearSMILES, which reduces the vocabulary size needed to represent a SMILES dataset, explicitly represents aromaticity via Kekulé SMILES, 3 and reduces the effort required by deep learning models to process SMILES. ClearSMILES reduced the rate of invalid samples by an order of magnitude, from 20% to 2.2%, and improved the fidelity of samples to the training set.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,007 | 0,008 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,001 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,001 | 0,000 |
| Science ouverte | 0,002 | 0,003 |
| Intégrité de la recherche | 0,000 | 0,001 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».