<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1606.03657/</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/1606.03657/feed.xml" rel="self" type="application/rss+xml" /><item><title>InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets — mentioned by kdoherty</title><link>https://news.ycombinator.com/item?id=15285827</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.03657:15285827</guid><pubDate>Tue, 19 Sep 2017 16:03:42 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;m assuming by iterate you mean &amp;quot;generate outputs of a GAN which preserve some order that you can iterate through.&amp;quot; The answer is yes, but not in the way that one might think. Despite the fact that we seed the GAN with input noise, there is no guarantee that the GAN makes use of this at all. This is a theme with GANs: we often want to imbue them with prior knowledge that we think is important, but is easily ignored by the GAN. In this case, we want to generate samples from p(x|z), where x is in the space of our data (often images, in this case passwords), but provided it gets good results…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.03657/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets — mentioned by fiter</title><link>https://news.ycombinator.com/item?id=14054599</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.03657:14054599</guid><pubDate>Thu, 06 Apr 2017 21:04:54 GMT</pubDate><description>&lt;p&gt;The paper I was thinking of is called: &amp;quot;InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets&amp;quot;[0]. I do not have experience training and investigating neural nets, but from what I read in that paper, there&amp;#x27;s no reason to presume you&amp;#x27;ll find neurons that represent a feature you&amp;#x27;re interested in. In the paper they alter the reward function to get neurons that correspond to the features they are interested in. [0] https://arxiv.org/pdf/1606.03657v1.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.03657/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets — mentioned by pinouchon</title><link>https://news.ycombinator.com/item?id=13577774</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.03657:13577774</guid><pubDate>Mon, 06 Feb 2017 09:05:45 GMT</pubDate><description>&lt;p&gt;I read the infoGAN paper yesterday. It blew my mind. https://arxiv.org/pdf/1606.03657v1.pdf. This is a way to do disentangled feature representation learning without supervision.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.03657/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets — mentioned by nl</title><link>https://news.ycombinator.com/item?id=13371423</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.03657:13371423</guid><pubDate>Wed, 11 Jan 2017 03:07:04 GMT</pubDate><description>&lt;p&gt;GANs (and InfoGAN[0] in particular) has shown there are still pretty huge breakthoughs out there. Some other things you may be interested in: Learning to learn by gradient descent by gradient descent[1] Neural Architecture Search with Reinforcement Learning[2] [0] https://arxiv.org/abs/1606.03657, https://arxiv.org/pdf/1701.00160.pdf [1] https://arxiv.org/abs/1606.04474 [2] https://openreview.net/pdf?id=r1Ue8Hcxg&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.03657/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets — mentioned by nl</title><link>https://news.ycombinator.com/item?id=12302473</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.03657:12302473</guid><pubDate>Wed, 17 Aug 2016 04:17:04 GMT</pubDate><description>&lt;p&gt;They have plenty of results. All their work on GANs[1][2] has been great, and the OpenAI gym has proven to be pretty popular for reinforcement learning research already. I&amp;#x27;m not sure how &amp;quot;hype&amp;quot; is measured - perhaps people thought they were going to invent some kind of AI entity we would have to persuade not to shoot us all by now or something. I know that all the papers coming out of OpenAI get hyped just as much as anything from DeepMind, Google Brain or FAIR, so there seems to be decent amount of hype still? But then usually that hype is justified, in which case maybe it is better…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.03657/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets — HN submission</title><link>https://news.ycombinator.com/item?id=12056301</link><guid isPermaLink="false">urn:hackerpapers:submission:1606.03657:12056301</guid><pubDate>Fri, 08 Jul 2016 15:44:21 GMT</pubDate><description>&lt;p&gt;InfoGAN: Representation Learning by Generative Adversarial Nets&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1606.03657/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets — mentioned by andreyk</title><link>https://news.ycombinator.com/item?id=11918766</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.03657:11918766</guid><pubDate>Thu, 16 Jun 2016 20:51:48 GMT</pubDate><description>&lt;p&gt;Brief summary: a nice intro about what generative models are and the current popular approaches/papers, followed by descriptions of recent work by OpenAI in the space. Quick links to papers mentioned: Improving GANs https://arxiv.org/abs/1606.03498 Improving VAEs http://arxiv.org/abs/1606.04934 InfoGAN https://arxiv.org/abs/1606.03657 Curiosity-driven Exploration in Deep Reinforcement Learning via Bayesian Neural Networks http://arxiv.org/abs/1605.09674 Generative Adversarial Imitation Learning http://arxiv.org/abs/1606.03476 I think the last one seems very exciting, I expect Imitation…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.03657/"&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>
