Semi-Implicit Graph Variational Auto-Encoders

Abstract

Semi-implicit graph variational auto-encoder (SIG-VAE) is proposed to expand the flexibility of variational graph auto-encoders (VGAE) to model graph data. SIG-VAE employs a hierarchical variational framework to enable neighboring node sharing for better generative modeling of graph dependency structure, together with a Bernoulli-Poisson link decoder. Not only does this hierarchical construction provide a more flexible generative graph model to better capture real-world graph properties, but also does SIG-VAE naturally lead to semi-implicit hierarchical variational inference that allows faithful modeling of implicit posteriors of given graph data, which may exhibit heavy tails, multiple modes, skewness, and rich dependency structures. Compared to VGAE, the derived graph latent representations by SIG-VAE are more interpretable, due to more expressive generative model and more faithful inference enabled by the flexible semi-implicit construction. Extensive experiments with a variety of graph data show that SIG-VAE significantly outperforms state-of-the-art methods on several different graph analytic tasks.

arXiv commentAccepted to Advances in Neural Information Processing Systems (NeurIPS 2019)

References in corpus (10)

• Finding community structure in networks using the eigenvectors of matrices
• Variational Inference with Normalizing Flows
• Representation Learning on Graphs with Jumping Knowledge Networks
• Variational Graph Auto-Encoders
• Variational Relevance Vector Machines
• Link Prediction Based on Graph Neural Networks
• Auxiliary Deep Generative Models
• HARP: Hierarchical Representation Learning for Networks
• Hyperspherical Variational Auto-Encoders
• Infinite Edge Partition Models for Overlapping Community Detection and Link Prediction

Cited by in corpus (9)

• Graph Self-Supervised Learning: A Survey
• How to Build a Graph-Based Deep Learning Architecture in Traffic Domain: A Survey
• Automated Self-Supervised Learning for Recommendation
• AEGCN: An Autoencoder-Constrained Graph Convolutional Network
• A Contrastive Variational Graph Auto-Encoder for Node Clustering
• Text to Image Synthesis using Stacked Conditional Variational Autoencoders and Conditional Generative Adversarial Networks
• BayReL: Bayesian Relational Learning for Multi-omics Data Integration
• Heuristic Semi-Supervised Learning for Graph Generation Inspired by Electoral College
• Contributions to Representation Learning with Graph Autoencoders and Applications to Music Recommendation