REVIEW 8 cited by
GraphAF: a Flow-based Autoregressive Model for Molecular Graph Generation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Molecular graph generation is a fundamental problem for drug discovery and has been attracting growing attention. The problem is challenging since it requires not only generating chemically valid molecular structures but also optimizing their chemical properties in the meantime. Inspired by the recent progress in deep generative models, in this paper we propose a flow-based autoregressive model for graph generation called GraphAF. GraphAF combines the advantages of both autoregressive and flow-based approaches and enjoys: (1) high model flexibility for data density estimation; (2) efficient parallel computation for training; (3) an iterative sampling process, which allows leveraging chemical domain knowledge for valency checking. Experimental results show that GraphAF is able to generate 68% chemically valid molecules even without chemical knowledge rules and 100% valid molecules with chemical rules. The training process of GraphAF is two times faster than the existing state-of-the-art approach GCPN. After fine-tuning the model for goal-directed property optimization with reinforcement learning, GraphAF achieves state-of-the-art performance on both chemical property optimization and constrained property optimization.
Forward citations
Cited by 8 Pith papers
-
MotifRole-Diff: Risk-Optimal Role-Aware Corruption for Masked Molecular Graph Diffusion
Role-specific masking rates, derived from measured reconstruction difficulty and graph impact, improve molecular graph generation validity and FCD over uniform masking at matched compute.
-
SIGMA: Semantic Identifier Grouping for Molecular Autoregression
A same-suffix contrastive objective makes autoregressive molecular-string models more invariant to how a molecule is written, improving generation fidelity on the reported ZINC benchmark.
-
Combining Graph Neural Networks and Mixed Integer Linear Programming for Molecular Inference under the Two-Layered Model
A GNN-based molecular inference framework simulates the trained GNN inside a MILP, enabling exact search for valid chemical graphs with desired predicted properties.
-
A Benchmark for Quantum Chemistry Relaxations via Machine Learning Interatomic Potentials
PubChemQCR is a large public dataset of DFT-based molecular relaxation trajectories with energy and force labels, benchmarked with nine machine learning interatomic potentials.
-
Vector Representations of Vessel Trees
VeTTA encodes a vascular tree into one vector and recursively decodes it into a geometrically accurate, topologically valid tree, outperforming voxel-based autoencoders on reconstruction metrics.
-
Decafs: Disentangled Conditional adversarial Flows
Decaf trains a Lie-group generator whose disentangled latent space is aligned with a normalizing flow's latent space, so that changing one learned coordinate changes one generative factor.
-
Adopting Reinforcement Learning with Verifiable Rewards for Molecular Generation
LLMol fine-tunes an LLM on simplified SELFIES and uses GRPO with RDKit-derived rewards for targeted molecular generation, but its own benchmark tables contradict the claimed state-of-the-art performance.
-
Graph Neural Networks in Modern AI-aided Drug Discovery
A comprehensive model-centric review of graph neural network methods and applications in AI-aided drug discovery, from molecular representation to synthesis planning.
Discussion (0). Sign in to comment.