GraViti: Graph-Level Variational Autoencoders with Relaxed Permutation Invariance
Not on the map. Why?
Abstract (arXiv)
We introduce GraViti, a transformer-based graph-level variational autoencoder that encodes entire graphs into single, fixed-dimensional latent vectors rather than per-node embeddings, yielding a graph-level latent space that supports smooth interpolation, property-guided search, and other downstream tasks beyond the reach of node-level approaches. GraViti achieves state-of-the-art reconstruction accuracy on large molecular graph datasets while offering competitive single-step generative performance. Our central finding concerns where permutation invariance is needed in such a model, and where it is not. The encoder remains permutation-invariant throughout, ensuring the model generalizes to graphs regardless of input order. The reconstruction loss, however, does not need to be: when training data is provided in a consistent node order, comparing predictions to targets directly in that order, without a graph-matching step, is sufficient. Relaxing invariance in the loss alone lets GraViti avoid the cubic-cost matching step required by prior graph-level autoencoders, reducing complexity to quadratic while improving reconstruction fidelity. We show the resulting latent space is chemically meaningful, supporting controlled molecular editing and property optimization, recovering established chemical trends, and enabling direct regression of graph-level properties from latent embeddings.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 36 of its 66 references that are in the map. First posted on arXiv 15 May 2026.
Builds on
36 of 66 references.
References · 36
- 2017Attention Is All You Needcited by 59,932
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2016Variational Graph Auto-Encoderscited by 1,373
- 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 786
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 702
- 2020A Generalization of Transformer Networks to Graphscited by 653
- 2018Junction Tree Variational Autoencoder for Molecular Graph Generationcited by 647
- 2022DiGress: Discrete Denoising diffusion for graph generationcited by 503
- 2021Rethinking Graph Transformers with Spectral Attentioncited by 468
- 2019InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximizationcited by 441
24 more
- 2018MolGAN: An implicit generative model for small molecular graphscited by 392
- 2020GraphAF: a Flow-based Autoregressive Model for Molecular Graph Generationcited by 301
- 2022Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equationscited by 273
- 2018Fr'echet ChemNet Distance: A metric for generative models for molecules in drug discoverycited by 191
- 2022Structure-Aware Transformer for Graph Representation Learningcited by 191
- 2021GraphDF: A Discrete Flow Model for Molecular Graph Generationcited by 177
- 2018Graphite: Iterative Generative Modeling of Graphscited by 112
- 2019D-VAE: A Variational Autoencoder for Directed Acyclic Graphscited by 98
- 2023Attending to Graph Transformerscited by 81
- 2024Variational Flow Matching for Graph Generationcited by 78
- 2024Categorical Flow Matching on Statistical Manifoldscited by 43
- 2020Multilevel Graph Matching Networks for Deep Graph Similarity Learningcited by 29
- 2022Graph Neural Networks with Adaptive Readoutscited by 29
- 2021Permutation-Invariant Variational Autoencoder for Graph-Level Representation Learningcited by 23
- 2023On Structural Expressive Power of Graph Transformerscited by 19
- 2024Poisson Variational Autoencodercited by 11
- 2022Micro and Macro Level Graph Modeling for Graph Variational Auto-Encoderscited by 8
- 2024Aligning Transformers with Weisfeiler-Lemancited by 8
- 2025The quest for the GRAph Level autoEncoder (GRALE)cited by 8
- 2024Any2Graph: Deep End-To-End Supervised Graph Prediction With An Optimal Transport Losscited by 7
- 2024Lift Your Molecules: Molecular Graph Generation in Latent Euclidean Spacecited by 7
- 2024What Are Good Positional Encodings for Directed Graphs?cited by 7
- 2023RGCVAE: Relational Graph Conditioned Variational Autoencoder for Molecule Designcited by 3
- 2025Towards Unsupervised Training of Matching-based Graph Edit Distance Solver via Preference-aware GANcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.