<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Adversarial Feature Learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1605.09782/</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/1605.09782/feed.xml" rel="self" type="application/rss+xml" /><item><title>Adversarial Feature Learning — mentioned by kastnerkyle</title><link>https://news.ycombinator.com/item?id=11829084</link><guid isPermaLink="false">urn:hackerpapers:mention:1605.09782: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/1605.09782/"&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>
