Wasserstein Adversarially Regularized Graph Autoencoder
Not on the map. Why?
Abstract (arXiv)
This paper introduces Wasserstein Adversarially Regularized Graph Autoencoder (WARGA), an implicit generative algorithm that directly regularizes the latent distribution of node embedding to a target distribution via the Wasserstein metric. The proposed method has been validated in tasks of link prediction and node clustering on real-world graphs, in which WARGA generally outperforms state-of-the-art models based on Kullback-Leibler (KL) divergence and typical adversarial framework.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 18 of its 28 references that are in the map. First posted on arXiv 9 Nov 2021.
Builds on
18 of 28 references.
References · 18
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2013Auto-Encoding Variational Bayescited by 4,053
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
- 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,576
- 2014DeepWalk: Online Learning of Social Representationscited by 1,547
- 2016Variational Graph Auto-Encoderscited by 1,382
- 2019Graph Neural Networks for Social Recommendationcited by 714
- 2017Wasserstein Auto-Encoderscited by 373
6 more
- 2018Sorting out Lipschitz function approximationcited by 213
- 2018Adversarially Regularized Graph Autoencoder for Graph Embeddingcited by 84
- 2019Graph Attention Auto-Encoderscited by 41
- 2021Rethinking Graph Auto-Encoder Models for Attributed Graph Clusteringcited by 37
- 2020Approximating Lipschitz continuous functions with GroupSort neural networkscited by 27
- 2017Large-scale analysis of disease pathways in the human interactomecited by 14
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 0; 2026: 1.
2 papers.