Model collection¶
Choose from 31 model classes for property prediction, molecular representations, and generation. Models accept SMILES strings and handle their own graph or sequence representations. Select a model below to see its parameters and method signatures. Example links open the code directly in each model’s reference page.
Predict properties¶
Fit on molecules and labels, then predict regression or classification targets. Start with GNN for a graph baseline or a SMILES model for a sequence baseline.
Model |
Approach |
Example |
|---|---|---|
GIN or GCN message passing, with optional virtual nodes. |
||
Graph rationales and environment-based data augmentation. |
||
Semi-supervised learning for imbalanced regression targets. |
||
Repetition-invariant graph representations for polymers. |
||
Graph learning aligned with the Bellman–Ford algorithm. |
||
Learning invariant graph rationales. |
||
Invariant risk minimization with graph neural networks. |
||
Relational pooling over node permutations. |
||
Regularization for generalization across graph sizes. |
||
Recurrent sequence learning from SMILES. |
||
Transformer sequence learning from SMILES. |
Learn molecular representations¶
Encode molecules as vectors for downstream prediction, clustering, or similarity analysis. Self-supervised encoders train on unlabeled SMILES; supervised encoders need the labels or pairs described below.
Model |
Training signal |
Example |
|---|---|---|
Reconstruct masked atom attributes. |
||
Motif-aware attribute masking and fingerprint reconstruction. |
||
Graph masked autoencoding. |
||
Predict molecular subgraph contexts. |
||
Predict whether pairs of atoms are connected. |
||
Learn agreement between graph and substructure representations. |
||
Molecular property labels or computed molecular descriptors. |
||
Pairwise similarity scores; dense or compressed molecular descriptors. |
||
Load a pretrained sequence encoder, such as ChemBERTa or ChemGPT. |
Generate molecules¶
Train a generator on molecules or load a pretrained model. Conditioning varies by method: property labels, molecular scaffolds, and scored demonstrations serve different purposes and have different input formats.
Model |
Approach and supported conditioning |
Example |
|---|---|---|
Graph diffusion with optional molecular demonstrations and normalized |
||
Masked diffusion over SAFE fragments, optionally retaining a supplied scaffold. |
||
Graph diffusion transformer with optional property labels. |
||
Discrete graph flow matching with optional property labels. |
||
Unconditional discrete graph diffusion. |
||
Unconditional score-based graph diffusion. |
||
Unconditional junction-tree variational autoencoding. |
||
Genetic search using property labels or a scoring oracle. |
||
Autoregressive SMILES transformer with optional properties and scaffold tokens. |
||
Recurrent SMILES generation with optional property labels. |
||
NovoMolGen, MolGen, Molexar, or SAFE-GPT checkpoints; constraints depend on the model family. |
See Installation for optional dependencies and Quickstart for complete workflows, including dataset preparation and checkpoint loading.