<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Autoencoding beyond pixels using a learned similarity metric · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1512.09300/</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/1512.09300/feed.xml" rel="self" type="application/rss+xml" /><item><title>Autoencoding beyond pixels using a learned similarity metric — mentioned by kastnerkyle</title><link>https://news.ycombinator.com/item?id=10930709</link><guid isPermaLink="false">urn:hackerpapers:mention:1512.09300:10930709</guid><pubDate>Tue, 19 Jan 2016 13:53:30 GMT</pubDate><description>&lt;p&gt;If we really want to get into &amp;quot;what is better&amp;quot; - the state of the art has recently moved significantly past this (paper [1] and blog [2]) - not to mention the recent submissions to ICLR in this realm [3][4]. GAN training is very tricky to get working in practice, especially on new problems, though conditional GAN seems to be a bit more stable in learning than the unconditional relatives. This blog deserves credit for thinking differently about a problem and getting something useful out of it. I think the goal of this inversion was to inspect what the cascade is &amp;quot;looking at&amp;quot; in some sense…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1512.09300/"&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>
