Venue: ICLR 2018 conference

Reviews:

final_score: rating: 8: Top 50% of accepted papers, clear accept
review_content: This paper satisfies the following necessary conditions for
acceptance. The writing is clear and I was able to understand the
presented method (and its motivation) despite not being too familiar
with the relevant literature. Explicitly writing the auto-encoder(s)
as pseudo-code algorithms was particular helpful. I found no technical
errors. The problem addressed is one worth solving - building a
generative model of observed data. There is some empirical testing
which show the presented method in a good light.

The authors are careful to relate the presented method with existing
ones, most notably VAE and AAE. I suppose one could argue that the
close connection to existing methods means that this paper is not
innovative enough. I think that would be unfair - most new methods
have close relations with existing ones - it is just that sometimes
the authors do not flag this up as they should.

WAE is a bit oversold. The authors state that WAE generates "samples
of better quality" (than VAE) without any condition being put on when
it does this. There is no proof that it is always better, and I can't
see how there could be. Any method of inferring a generative model
from data must make some 'inductive' assumptions. Surely one could
devise situations where VAE outperforms WAE. I think this issue should
have been examined in more depth.

I found no typo or grammatical errors which is unusual - good careful
job!


review_title: This is a well-written paper which provides a useful generalisation of some existing methods for inferring generative models.

final_score: rating: 8: Top 50% of accepted papers, clear accept
review_content: This paper provides a reasonably comprehensive generalization to VAEs and Adversarial Auto-encoders through the lens of the Wasserstein metric. By posing the auto-encoder design as a dual formulation of optimal transport, the proposed work supports the use of both deterministic and random decoders under a common framework. In my opinion, this is one of the crucial contributions of this paper. While the existing properties of auto-encoders are preserved, stability characteristics of W-GANs are also observed in the proposed architecture. The results from MNIST and CelebA datasets look convincing, though could include additional evaluation to compare the adversarial loss with the straightforward MMD metric and potentially discuss their pros and cons. In some sense, given the challenges in evaluating and comparing closely related auto-encoder solutions, the authors could design demonstrative experiments for cases where Wassersterin distance helps and may be  its potential limitations.

The closest work to this paper is the adversarial variational bayes framework by Mescheder et.al. which also attempts at unifying VAEs and GANs. While the authors describe the conceptual differences and advantages over that approach, it will be beneficial to actually include some comparisons in the results section.
review_title: A well-written paper that generalizes Wasserstein distance to VAEs 

final_score: rating: 8: Top 50% of accepted papers, clear accept
review_content: This very well written paper covers the span between W-GAN and VAE. For a reviewer who is not an expert in the domain, it reads very well, and would have been of tutorial quality if space had allowed for more detailed explanations. The appendix are very useful, and tutorial paper material (especially A). 

While I am not sure description would be enough to reproduce and no code is provided, every aspect of the architecture, if not described, if referred as similar to some previous work. There are also some notation shortcuts (not explained) in the proof of theorems that can lead to initial confusion, but they turn out to be non-ambiguous. One that could be improved is P(P_X, P_G) where one loses the fact that the second random variable is Y.


This work contains plenty of novel material, which is clearly compared to previous work:
- The main consequence of the use of Wasserstein distance is the surprisingly simple and useful Theorem 1. I could not verify its novelty, but this seems to be a great contribution.
- Blending GAN and auto-encoders has been tried in the past, but the authors claim better theoretical foundations that lead to solutions that do not rquire min-max
- The use of MMD in the context of GANs has also been tried. The authors claim that their use in the latent space makes it more practival

The experiments are very convincing, both numerically and visually.

Source of confusion: in algorithm 1 and 2, \tilde{z} is "sampled" from Q_TH(Z|xi), some one is lead to believe that this is the sampling process as in VAEs, while in reality Q_TH(Z|xi) is deterministic in the experiments.
review_title: Excellent tutorial papers with novel contributions and convincing results

Meta-review: This paper proposes a new generative model that has the stability of variational autoencoders (VAE) while producing better samples. The authors clearly compare their work to previous efforts that combine VAEs and Generative Adversarial Networks with similar goals.  Authors show that the proposed algorithm is a generalization of Adversarial Autoencoder (AAE) and minimizes Wasserstein distance between model and target distribution. The paper is well written with convincing results. Reviewers agree that the algorithm is novel and practical; and close connections of the algorithm to related approaches are clearly discussed with useful insights.  Overall, the paper is strong and I recommend acceptance.
Decision: Accept (Oral)