pith. sign in

arxiv: 2001.09382 · v2 · pith:EI7DJPPHnew · submitted 2020-01-26 · 💻 cs.LG · stat.ML

GraphAF: a Flow-based Autoregressive Model for Molecular Graph Generation

classification 💻 cs.LG stat.ML
keywords graphafchemicalmodelautoregressiveflow-basedgenerationgraphmolecular
0
0 comments X
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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. How Creative Are Large Language Models in Generating Molecules?

    cs.CL 2026-04 unverdicted novelty 7.0

    Large language models exhibit distinct creative patterns in molecule generation, including higher constraint satisfaction when more constraints are added, and this is the first work to reframe molecule generation abil...

  2. Scalable Quantum Molecular Generation via GPU-Accelerated Tensor-Network Simulation

    quant-ph 2026-04 unverdicted novelty 7.0

    SQMG introduces an atom-fixed, bond-reused variational quantum circuit for molecular graph generation that achieves linear qubit scaling and enables GPU-accelerated tensor-network simulation up to 40 heavy atoms.

  3. GraphWeave: Interpretable and Robust Graph Generation via Random Walk Trajectories

    cs.LG 2025-09 unverdicted novelty 7.0

    GraphWeave learns graph family patterns via random walk trajectories and reconstructs new graphs through joint optimization, outperforming diffusion baselines on benchmarks for structures like communities and degree d...

  4. MolWorld: Molecule World Models for Actionable Molecular Optimization

    cs.LG 2026-05 unverdicted novelty 6.0

    MolWorld expands a molecule-transfer graph using a world model to discover high-property molecules that maintain strong structural connectivity to known compounds for actionable optimization.