pith. sign in

arxiv: 1905.11600 · v1 · pith:C6AMKHQ3new · submitted 2019-05-28 · 📊 stat.ML · cs.AI· cs.LG

GraphNVP: An Invertible Flow Model for Generating Molecular Graphs

classification 📊 stat.ML cs.AIcs.LG
keywords generationmodelmoleculargraphgraphnvpgraphsinvertiblemolecules
0
0 comments X p. Extension
pith:C6AMKHQ3 Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{C6AMKHQ3}

Prints a linked pith:C6AMKHQ3 badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

We propose GraphNVP, the first invertible, normalizing flow-based molecular graph generation model. We decompose the generation of a graph into two steps: generation of (i) an adjacency tensor and (ii) node attributes. This decomposition yields the exact likelihood maximization on graph-structured data, combined with two novel reversible flows. We empirically demonstrate that our model efficiently generates valid molecular graphs with almost no duplicated molecules. In addition, we observe that the learned latent space can be used to generate molecules with desired chemical properties.

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 5 Pith papers

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

  1. Evaluating LLMs on Large-Scale Graph Property Estimation via Random Walks

    cs.LG 2026-05 unverdicted novelty 7.0

    EstGraph benchmark evaluates LLMs on estimating properties of very large graphs from random-walk samples that fit in context limits.

  2. Personalized Multi-Interest Modeling for Cross-Domain Recommendation to Cold-Start Users

    cs.IR 2026-04 unverdicted novelty 7.0

    NF-NPCDR enhances neural processes with normalizing flows to model personalized multi-interest preferences and uses a preference pool plus adaptive decoder to improve cross-domain recommendations for cold-start users.

  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. Equivariant Efficient Joint Discrete and Continuous MeanFlow for Molecular Graph Generation

    cs.LG 2026-04 unverdicted novelty 6.0

    EQUIMF is a unified equivariant framework that jointly generates discrete topologies and continuous geometries in molecular graphs via synchronized MeanFlow dynamics for efficient few-step sampling.

  5. BadGraph: A Backdoor Attack Against Latent Diffusion Model for Text-Guided Graph Generation

    cs.LG 2025-10 conditional novelty 6.0

    BadGraph poisons training data with textual triggers to implant backdoors in latent diffusion models for text-guided graph generation, achieving 50% attack success rate at under 10% poisoning and over 80% at 24% poiso...