Pith. sign in

REVIEW 2 cited by

A Graph VAE and Graph Transformer Approach to Generating Molecular Graphs

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

arxiv 2104.04345 v1 pith:BA4DKOSY submitted 2021-04-09 cs.LG

classification cs.LG
keywords graphmodelgraphspropertiestransformeredgeencodinggenerating
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We propose a combination of a variational autoencoder and a transformer based model which fully utilises graph convolutional and graph pooling layers to operate directly on graphs. The transformer model implements a novel node encoding layer, replacing the position encoding typically used in transformers, to create a transformer with no position information that operates on graphs, encoding adjacent node properties into the edge generation process. The proposed model builds on graph generative work operating on graphs with edge features, creating a model that offers improved scalability with the number of nodes in a graph. In addition, our model is capable of learning a disentangled, interpretable latent space that represents graph properties through a mapping between latent variables and graph properties. In experiments we chose a benchmark task of molecular generation, given the importance of both generated node and edge features. Using the QM9 dataset we demonstrate that our model performs strongly across the task of generating valid, unique and novel molecules. Finally, we demonstrate that the model is interpretable by generating molecules controlled by molecular properties, and we then analyse and visualise the learned latent representation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. SFi-Former: Sparse Flow Induced Attention for Graph Transformer

    cs.LG 2025-04 conditional novelty 6.0 of 10

    SFi-Former replaces dense graph transformer attention with sparse flows from an l1-regularized energy minimization, improving long-range graph benchmark accuracy and generalization.

  2. JTreeformer: Graph-Transformer via Latent-Diffusion Model for Molecular Generation

    cs.LG 2025-04 conditional novelty 5.0 of 10

    JTreeformer, a junction-tree graph transformer with latent-diffusion sampling, reports improved internal diversity on MOSES and higher uniqueness and novelty on QM9 compared with cited baselines.

Pith tools