Wasserstein Adversarially Regularized Graph Autoencoder
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.
Code (1)
Tasks
ClusteringLink PredictionNode ClusteringSimilar Papers 제목 키워드 기반
Adversarially Regularized Autoencoders
Deep latent variable models, trained using variational autoencoders or generative adversarial networks, are now a key technique for representation learning of continuous structures. However, applying similar methods to d…
Representation LearningStyle TransferAdversarially Regularized Graph Autoencoder for Graph Embedding
Graph embedding is an effective method to represent graph data in a low dimensional space for graph analytics. Most existing embedding algorithms typically focus on preserving the topological structure or minimizing the …
ClusteringDecoderGraph ClusteringGraph Embedding+1Learning Graph Embedding with Adversarial Training Methods
Graph embedding aims to transfer a graph into vectors to facilitate subsequent graph analytics tasks like link prediction and graph clustering. Most approaches on graph embedding focus on preserving the graph structure o…
ClusteringDecoderGraph ClusteringGraph Embedding+2Poison Attacks against Text Datasets with Conditional Adversarially Regularized Autoencoder
This paper demonstrates a fatal vulnerability in natural language inference (NLI) and text classification systems. More concretely, we present a 'backdoor poisoning' attack on NLP models. Our poisoning attack utilizes co…
ClassificationGeneral ClassificationNatural Language Inferencetext-classification+1Disentangled Representation Learning with Wasserstein Total Correlation
Unsupervised learning of disentangled representations involves uncovering of different factors of variations that contribute to the data generation process. Total correlation penalization has been a key component in rece…
DisentanglementRepresentation Learning