Variational Graph Auto-Encoders
read the original abstract
We introduce the variational graph auto-encoder (VGAE), a framework for unsupervised learning on graph-structured data based on the variational auto-encoder (VAE). This model makes use of latent variables and is capable of learning interpretable latent representations for undirected graphs. We demonstrate this model using a graph convolutional network (GCN) encoder and a simple inner product decoder. Our model achieves competitive results on a link prediction task in citation networks. In contrast to most existing models for unsupervised learning on graph-structured data and link prediction, our model can naturally incorporate node features, which significantly improves predictive performance on a number of benchmark datasets.
This paper has not been read by Pith yet.
Forward citations
Cited by 41 Pith papers
-
Learning Feature Encoder with Synthetic Anomalies for Weakly Supervised Graph Anomaly Detection
A multi-task scheme with synthetic anomalies from graph perturbations and two-phase training learns robust features for weakly supervised graph anomaly detection, outperforming competitors on public datasets.
-
Robustness of Graph Self-Supervised Learning to Real-World Noise: A Case Study on Text-Driven Biomedical Graphs
Feature reconstruction in GSSL is robust to noise in text-driven biomedical graphs while relation reconstruction is sensitive, with bidirectional GNN architectures performing better on noisy data and yielding up to 7%...
-
Continual Learning for fMRI-Based Brain Disorder Diagnosis via Functional Connectivity Matrices Generative Replay
A structure-aware VAE generates realistic FC matrices for replay, combined with multi-level knowledge distillation and hierarchical contextual bandit sampling, to enable continual fMRI-based brain disorder diagnosis a...
-
Building Deep Graph Predictors with Graph Imitation Learning
GRAIL trains graph predictors via imitation learning by modeling generation as sequential decisions on partial graph embeddings, matching or exceeding prior methods on 18 benchmarks.
-
Energy-Balanced Hyperspherical Graph Representation Learning via Structural Binding and Entropic Dispersion
HyperGRL places graph nodes on a hypersphere and minimizes Helmholtz free energy with structural binding energy and mean-field repulsive potential, regulated by an adaptive thermostat, to produce discriminative repres...
-
Joint Relational Database Generation via Graph-Conditional Diffusion Models
GRDM jointly generates relational database tables via graph-conditional diffusion without table ordering, outperforming autoregressive baselines on multi-hop correlations and single-table fidelity across six real RDBs.
-
Self-supervised Adversarial Purification for Graph Neural Networks
GPR-GAE is a novel self-supervised graph auto-encoder purifier using multiple GPR filters and multi-step recovery that delivers state-of-the-art robustness for GNNs against structural attacks as a plug-and-play module.
-
Learning Transferable Topology Priors for Multi-Agent LLM Collaboration Across Domains
TopoPrior learns transferable topology priors offline from multi-domain reference graphs using a conditional variational graph model and adversarial adaptation to initialize collaboration structures for multi-agent LL...
-
GraViti: Graph-Level Variational Autoencoders with Relaxed Permutation Invariance
GraViti introduces a graph-level VAE with relaxed permutation invariance that maps whole graphs to latent vectors, achieves strong reconstruction on large molecular datasets, and generates valid samples by learning co...
-
A Unified Benchmark for Evaluating Knowledge Graph Construction Methods and Graph Neural Networks
A dual-purpose benchmark supplies two text-derived knowledge graphs and one expert reference graph on the same biomedical corpus to jointly measure construction method quality and GNN robustness via semi-supervised no...
-
Graph Federated Unlearning for Privacy Preservation
Orthogonal unlearning updates plus server-side virtual clients enable effective user data removal in graph federated learning without major performance loss.
-
H3: A Healthcare Three-Hop Index for Physician Referral Network Prediction
H3 is a new three-hop index that predicts physician referrals using normalized indirect pathways and outperforms heuristics and neural nets on Medicare shared-patient data in both within-period and cross-period settings.
-
Mochi: Aligning Pre-training and Inference for Efficient Graph Foundation Models via Meta-Learning
Mochi aligns pre-training with inference via meta-learning for efficient graph foundation models, matching or exceeding prior models on 25 datasets with 8-27x less training time.
-
Spectral Embeddings Leak Graph Topology: Theory, Benchmark, and Adaptive Reconstruction
LoGraB creates fragmented graph benchmarks with controls for radius, spectral quality, noise, and coverage, while AFR reconstructs faithful graph islands from spectral patches using fidelity scoring, RANSAC-Procrustes...
-
Graph self-supervised learning based on frequency corruption
FC-GSSL improves graph SSL by generating high-frequency biased corrupted graphs via low-frequency contribution-based corruption, reconstructing low-frequency features in an autoencoder, and aligning multi-view represe...
-
A Physics-Aware Variational Graph Autoencoder for Joint Modal Identification with Uncertainty Quantification
A physics-informed graph variational autoencoder jointly predicts modal frequencies, damping, and shapes from PSD data of trusses with uncertainty quantification and orthogonality constraints.
-
Mitigating Structural Overfitting: A Distribution-Aware Rectification Framework for Missing Feature Imputation
DART mitigates structural overfitting in graph missing-feature imputation via global structural augmentation, masked-autoencoder semantic rectification, and test-time distribution rectification, outperforming prior me...
-
Discrete Bayesian Sample Inference for Graph Generation
GraphBSI uses Bayesian Sample Inference as noise-controlled SDEs to generate discrete graphs in one shot, achieving state-of-the-art results on molecular benchmarks Moses and GuacaMol.
-
Graph-Based Alternatives to LLMs for Human Simulation
GEMS formulates close-ended human-behavior simulation as link prediction on a heterogeneous graph and matches or exceeds LLM performance with three orders of magnitude fewer parameters across three datasets and three ...
-
SSL4RL: Revisiting Self-supervised Learning as Intrinsic Reward for Visual-Language Reasoning
SSL4RL reformulates self-supervised learning objectives into dense, verifiable reward signals for RL-based fine-tuning of vision-language models, yielding performance gains on reasoning benchmarks.
-
A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning
A hierarchical quantized tokenization framework with task-adaptive routing and dual-view streams for improved graph representation learning on node classification and link prediction.
-
Geometric Autoencoder Priors for Bayesian Inversion: Learn First Observe Later
GABI learns geometry-conditioned latent priors from multi-geometry physical response datasets for use in Bayesian inversion, yielding geometry-adapted posteriors via ABC sampling.
-
Heterogeneous Temporal Hypergraph Neural Network
The paper proposes the Heterogeneous Temporal HyperGraph Neural Network (HTHGN) with a new hyperedge construction algorithm, hierarchical attention for temporal message passing, and contrastive learning to model high-...
-
Inductive Entity Representations from Text via Link Prediction
Entity representations learned from text via link prediction generalize to unseen entities and transfer to classification and retrieval with reported gains of 22% MRR, 16% accuracy, and 8.8% NDCG@10.
-
Semi-Supervised Graph Embedding for Multi-Label Graph Node Classification
ML-GCN embeds nodes via GCN, generates a label matrix in the same space, and trains with relaxed skip-gram on node-label concatenations to model correlations, reporting outperformance on graph datasets.
-
Fast and Featureless Node Representation Learning with Partial Pairwise Supervision
Contrastive FUSE learns node embeddings from partial pairwise supervision and structural signals alone by optimizing a spectral contrastive objective with a lightweight modularity approximation, yielding competitive p...
-
Astro Generative Network: A Variational Framework for Controlled Node Insertion in Incomplete Complex Networks
AGN is a variational framework for inserting plausible new nodes into incomplete networks by latent sampling and similarity attachment, shown on synthetic data to keep clustering and modularity changes modest compared...
-
Combining opinion and structural similarity in link recommendations to counter extreme polarization
Weak structural similarity combined with strong opinion similarity in link recommendations prevents network fragmentation and favors moderate opinions under strong homophily.
-
From Load Tests to Live Streams: Graph Embedding-Based Anomaly Detection in Microservice Architectures
A GCN-GAE model learns node embeddings from directed weighted microservice graphs to flag anomalies via cosine similarity between load-test and live-event representations, with a synthetic injection framework reportin...
-
Extracting Money Laundering Transactions from Quasi-Temporal Graph Representation
ExSTraQt uses quasi-temporal graph representations and supervised learning to detect suspicious transactions, achieving F1 score uplifts of up to 1% on real data and over 8% on synthetic datasets compared to prior AML models.
-
AutoGraphAD: Unsupervised network anomaly detection using Variational Graph Autoencoders
AutoGraphAD applies a heterogeneous variational graph autoencoder with unsupervised and contrastive learning to detect network anomalies on connection-IP graphs without labeled data, achieving comparable performance t...
-
Decoder-only Clustering in Attributed Graphs
A new method for nodal clustering in attributed graphs that combines low-dimensional node priors, a neural decoder, and graph-fused LASSO regularization on prior means, demonstrated via simulations on grid graphs and ...
-
Disentangled Generative Graph Representation Learning
DiGGR introduces a self-supervised graph representation learning framework that disentangles latent factors to guide mask modeling and improve representation quality on graph tasks.
-
Explaining Graph Neural Networks for Node Similarity on Graphs
Empirical comparison shows gradient-based explanations for GNN node similarities are actionable, consistent, and retain effects when sparsified, unlike mutual information explanations.
-
$\texttt{SynC}$: Synergistic Boosting of Structure and Representation for Deep Graph Clustering
SynC introduces a shared-weight TIGAE-based framework that alternates embedding learning and structure augmentation for graph clustering, with added fine-tuning for low-homophily graphs and reported gains on benchmarks.
-
CROSS-Net: Region-Agnostic Taxi-Demand Prediction Using Feature Disentanglement
CROSS-Net combines multiview graph neural networks with VAE-based feature disentanglement to predict taxi demand in previously unseen urban regions.
-
Spectral-based Graph Convolutional Network for Directed Graphs
A spectral-based GCN for directed graphs uses redefined Laplacians to enable direct application to directed data and outperforms prior methods on semi-supervised node classification tasks.
-
Detecting Complex Money Laundering Patterns with Incremental and Distributed Graph Modeling
ReDiRect uses fuzzy graph partitioning for distributed unsupervised money laundering detection and a refined evaluation metric, claiming better efficiency than prior methods on Libra and IBM datasets.
-
Leveraging Medical Foundation Model Features in Graph Neural Network-Based Retrieval of Breast Histopathology Images
A graph autoencoder model using foundation model features achieves high retrieval accuracy (mAP 96.7-97.6%, mMV 91.5-94.2%) on BreakHis and BACH breast cancer histopathology datasets.
-
Graph Embeddings at Scale
Presents a distributed infrastructure for scaling skip-gram graph embeddings to 68M-vertex networks by avoiding partitioning, using dynamic size-constrained graphs, and efficient indexing for updates.
-
Graph Neural Networks for Community Detection in Graph Signal Analysis
The paper integrates GNN community detection into a PUM-GBF interpolation scheme and reports accurate signal reconstructions on geometric and urban graph benchmarks.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.