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 discrete structures, such as text sequences or discretized images, has proven to be more challenging. In this work, we propose a flexible method for training deep latent variable models of discrete structures. Our approach is based on the recently-proposed Wasserstein autoencoder (WAE) which formalizes the adversarial autoencoder (AAE) as an optimal transport problem. We first extend this framework to model discrete sequences, and then further explore different learned priors targeting a controllable representation. This adversarially regularized autoencoder (ARAE) allows us to generate natural textual outputs as well as perform manipulations in the latent space to induce change in the output space. Finally we show that the latent representation can be trained to perform unaligned textual style transfer, giving improvements both in automatic/human evaluation compared to existing methods.
Code (6)
Tasks
Representation LearningStyle TransferMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Learning Deep Network Representations with Adversarially Regularized Autoencoders
The problem of network representation learning, also known as network embedding, arises in many machine learning tasks assuming that there exist a small number of variabilities in the vertex representations which can cap…
Link PredictionMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATIONNetwork Embedding+1Adversarially Approximated Autoencoder for Image Generation and Manipulation
Regularized autoencoders learn the latent codes, a structure with the regularization under the distribution, which enables them the capability to infer the latent codes given observations and generate new samples given t…
Generative Adversarial NetworkImage GenerationWasserstein 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…
ClusteringLink PredictionNode ClusteringAdversarially robust generalization theory via Jacobian regularization for deep neural networks
Powerful deep neural networks are vulnerable to adversarial attacks. To obtain adversarially robust models, researchers have separately developed adversarial training and Jacobian regularization techniques. There are abu…
Adversarial AttackAdversarially 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+1