<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A note on the evaluation of generative models · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1511.01844/</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/1511.01844/feed.xml" rel="self" type="application/rss+xml" /><item><title>A note on the evaluation of generative models — mentioned by godelski</title><link>https://news.ycombinator.com/item?id=36688068</link><guid isPermaLink="false">urn:hackerpapers:mention:1511.01844:36688068</guid><pubDate>Tue, 11 Jul 2023 22:23:18 GMT</pubDate><description>&lt;p&gt;&amp;gt; I have used LLMs on actually novel tasks for which there aren’t any datasets out there. They “get it”. Can you give an example so that we may better discuss or that I can adequately update my understandings? But I will say that simplifying this down to &amp;quot;just trained to predict the next token&amp;quot; is not accurate as it does not account for the differences in architectures and cost functions which dramatically affect this statement due to the differences in their biases. As a clear example, training an image model on likelihood does note guarantee that the model will produce high fidelity…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1511.01844/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>A note on the evaluation of generative models — mentioned by godelski</title><link>https://news.ycombinator.com/item?id=36129656</link><guid isPermaLink="false">urn:hackerpapers:mention:1511.01844:36129656</guid><pubDate>Tue, 30 May 2023 19:46:35 GMT</pubDate><description>&lt;p&gt;Oh yeah, those are great papers, which I wish more people read. (I&amp;#x27;ll never not laugh at the journal name) I&amp;#x27;ll add this too[0] since it seems to be highly missed. But as far as validation sets, I have a hard time convincing anyone I talk to that tuning on test data is information leakage. I&amp;#x27;ve also had issues with discussing people (even outside my lab, even at big schools/labs) what &amp;quot;uncurated samples&amp;quot; means. I say &amp;quot;you sample batch and show that&amp;quot; they say you can sample multiple batches and pick the best one... So this is the same kind of thinking and shows why evaluating generative papers…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1511.01844/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>A note on the evaluation of generative models — mentioned by godelski</title><link>https://news.ycombinator.com/item?id=35506691</link><guid isPermaLink="false">urn:hackerpapers:mention:1511.01844:35506691</guid><pubDate>Sun, 09 Apr 2023 21:32:46 GMT</pubDate><description>&lt;p&gt;It is also important to remember that there are different inductive biases for different networks. Sutton&amp;#x27;s &amp;quot;Bitter Lesson&amp;quot;[0] argues for scale + more arbitrary complexity. ViTs scale really well because some of this arbitrary complexity. But I agree with your point that what to use is not obvious and this gets really complicated real quickly. For example, Swin loses some of the properties of self-attention but Neighborhood Attention doesn&amp;#x27;t[1] (these are both considered reductive attention types). Does this have a large effect? Might depend on your task. Looking at non-classification tasks…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1511.01844/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>A note on the evaluation of generative models — mentioned by 317070</title><link>https://news.ycombinator.com/item?id=16020935</link><guid isPermaLink="false">urn:hackerpapers:mention:1511.01844:16020935</guid><pubDate>Thu, 28 Dec 2017 08:06:12 GMT</pubDate><description>&lt;p&gt;GANs are for graphics, not machine learning. They have no test scores as they cannot run on the test set. Therefore, its hard to tell how much they overfit. But they have uses, like for lossy compression of images or texture generation. Stuff which focuses on the graphical side of things where it outperforms machine learning methods with its crisper samples. For an overview of this argument: https://arxiv.org/abs/1511.01844 The idea of adversarial training is important and relevant in ML though! It allows for setting up losses which are hard to formulate otherwise.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1511.01844/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>A note on the evaluation of generative models — mentioned by 317070</title><link>https://news.ycombinator.com/item?id=13712804</link><guid isPermaLink="false">urn:hackerpapers:mention:1511.01844:13712804</guid><pubDate>Thu, 23 Feb 2017 10:08:49 GMT</pubDate><description>&lt;p&gt;Actually, there is a formal method to evaluate generative models. All you need is a validation set. Then you need to find what the odds are that the model would have generated your validation set. That probability is the one you want to maximize [0]. In order to be able to calculate or estimate this probability, you need to make some amendments to your model architecture. But for instance PixelCNN&amp;#x27;s know the probability exactly, variational auto-encoders have a lower bound on the probability, etc. It is mainly the generative adverserial networks (GANs) which cannot. And this is the reason…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1511.01844/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item></channel></rss>
