<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Pixel Recurrent Neural Networks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1601.06759/</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/1601.06759/feed.xml" rel="self" type="application/rss+xml" /><item><title>Pixel Recurrent Neural Networks — mentioned by vvolhejn</title><link>https://news.ycombinator.com/item?id=45660656</link><guid isPermaLink="false">urn:hackerpapers:mention:1601.06759:45660656</guid><pubDate>Tue, 21 Oct 2025 19:40:01 GMT</pubDate><description>&lt;p&gt;I had a part about this but I took it out: for compression, you could keep the embeddings unquantized and it would still compress quite well, depending on the embedding dimension and the number of quantization levels. But categorical distributions are better for modelling. It&amp;#x27;s a little difficult to explain here without using diagrams. The intuition is that if you try to have a model predict the next embedding and not the next token, you can&amp;#x27;t model multimodal distributions - you&amp;#x27;ll end up predicting the mean of the possible continuations and not the mode, which is not what you want. Check…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1601.06759/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item><item><title>Pixel Recurrent Neural Networks — mentioned by WithinReason</title><link>https://news.ycombinator.com/item?id=41835379</link><guid isPermaLink="false">urn:hackerpapers:mention:1601.06759:41835379</guid><pubDate>Mon, 14 Oct 2024 08:17:11 GMT</pubDate><description>&lt;p&gt;Diffusion works significantly better for images than sequential pixel generation, there is a good chance it would work better for language as well. Sequential generation used to be state of the art in 2016 and it&amp;#x27;s basically how current LLMs work: https://arxiv.org/abs/1601.06759&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1601.06759/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item><item><title>Pixel Recurrent Neural Networks — mentioned by blueblimp</title><link>https://news.ycombinator.com/item?id=23721991</link><guid isPermaLink="false">urn:hackerpapers:mention:1601.06759:23721991</guid><pubDate>Fri, 03 Jul 2020 07:59:55 GMT</pubDate><description>&lt;p&gt;Are the results actually good? Table 2 reports 3.40 bits/dim on CIFAR-10, but PixelRNN in 2016 got 3.06 bits/dim (Table 3 in https://arxiv.org/abs/1601.06759). I would like to compare the MNIST results also but I&amp;#x27;m having trouble converting between bits/dim and nats in a way that gives a sensible result. It&amp;#x27;s a bit annoying that the paper does not compare to previously-reported numbers on these benchmarks.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1601.06759/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item><item><title>Pixel Recurrent Neural Networks — mentioned by etaioinshrdlu</title><link>https://news.ycombinator.com/item?id=23555752</link><guid isPermaLink="false">urn:hackerpapers:mention:1601.06759:23555752</guid><pubDate>Wed, 17 Jun 2020 19:37:40 GMT</pubDate><description>&lt;p&gt;This looks like a new iteration on the Pixel-RNN idea: https://arxiv.org/pdf/1601.06759.pdf GPT2 definitely looks better.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1601.06759/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item><item><title>Pixel Recurrent Neural Networks — mentioned by 0-_-0</title><link>https://news.ycombinator.com/item?id=22374858</link><guid isPermaLink="false">urn:hackerpapers:mention:1601.06759:22374858</guid><pubDate>Thu, 20 Feb 2020 13:22:23 GMT</pubDate><description>&lt;p&gt;As an example from 29 Feb 2016, for lossless compression you can go from 8 to 3 bits per color according to Table 5 here: https://arxiv.org/abs/1601.06759&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1601.06759/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item><item><title>Pixel Recurrent Neural Networks — mentioned by cs702</title><link>https://news.ycombinator.com/item?id=18198486</link><guid isPermaLink="false">urn:hackerpapers:mention:1601.06759:18198486</guid><pubDate>Fri, 12 Oct 2018 01:45:45 GMT</pubDate><description>&lt;p&gt;These guys have done what looks like an impressive amount of work... but I was disappointed to see there&amp;#x27;s no mention of generative language modeling at all and only a very brief mention of key advances in image generation over the past few years. Examples of generative language modeling ignored by this paper (not even mentioned): * Unsupervised Transformer - https://blog.openai.com/language-unsupervised/ * ELMo - https://arxiv.org/abs/1802.05365 * ULMFit - https://arxiv.org/abs/1801.06146 Examples of generative image modeling ignored by this paper (some are mentioned only in passing): * Glow…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1601.06759/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item><item><title>Pixel Recurrent Neural Networks — mentioned by kastnerkyle</title><link>https://news.ycombinator.com/item?id=11829084</link><guid isPermaLink="false">urn:hackerpapers:mention:1601.06759:11829084</guid><pubDate>Fri, 03 Jun 2016 08:43:53 GMT</pubDate><description>&lt;p&gt;Yes, although the particular technique used here (variational autoencoder, or VAE) doesn&amp;#x27;t benefit from increasing the code space due to a particular penalty (KL divergence against a fixed N(0, 1) Gaussian prior) during training. So even by making it go to 1000 digits in the code space, the model will probably still only choose to use 5 or 10 dimensions unless the KL penalty is relaxed, making it closer to a standard autoencoder. An autoencoder with a much larger code space could be an improvement, or some newer works such as Adversarially Learned Inference / Adversarial Feature Learning [0…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1601.06759/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item></channel></rss>
