<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Comparison of Maximum Likelihood and GAN-based training of Real NVPs · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1705.05263/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1705.05263/feed.xml" rel="self" type="application/rss+xml" /><item><title>Comparison of Maximum Likelihood and GAN-based training of Real NVPs — mentioned by ericjang</title><link>https://news.ycombinator.com/item?id=15575909</link><guid isPermaLink="false">urn:hackerpapers:mention:1705.05263:15575909</guid><pubDate>Sat, 28 Oct 2017 17:28:43 GMT</pubDate><description>&lt;p&gt;This is a general problem for generative models, regardless of whether they are explicit latent density (variational autoencoders) or implicit density (GANs) or fully-observed (PixelCNN). To date no consensus has been reached in the research community on what the &amp;quot;right&amp;quot; way to evaluate a generative model is: e.g. Parzen Windows estimators, log-probability, ELBO, etc. Yann Lecun himself (as of NIPS2016) was pretty critical of probability-based metrics, as those have strong dependence to the choice of model (e.g. if the model is poor the log-probability is meaningless). In GANs, the critic and…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1705.05263/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
