<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Mode-Collapse on Aayush Bajaj's Augmenting Infrastructure</title><link>https://abaj.ai/tags/mode-collapse/</link><description>Recent content in Mode-Collapse on Aayush Bajaj's Augmenting Infrastructure</description><generator>Hugo</generator><language>en</language><copyright>© 2026 Aayush Bajaj</copyright><lastBuildDate>Fri, 10 Jul 2026 08:15:43 +1000</lastBuildDate><atom:link href="https://abaj.ai/tags/mode-collapse/index.xml" rel="self" type="application/rss+xml"/><item><title>GAN: Generative Adversarial Networks</title><link>https://abaj.ai/wiki/ml/dl/gans/</link><pubDate>Fri, 10 Jul 2026 01:42:07 +1000</pubDate><guid>https://abaj.ai/wiki/ml/dl/gans/</guid><description>&lt;p>a gan trains a generator by making it play a game against a learned critic: the &lt;strong>generator&lt;/strong> \(G\) maps noise to samples, the &lt;strong>discriminator&lt;/strong> \(D\) tries to tell those samples from real data, and each improves by exploiting the other&amp;rsquo;s current weakness — density estimation recast as a two-player minimax game (goodfellow et al. 2014, &lt;a
 href="https://arxiv.org/abs/1406.2661"
 
 
 class="link--external" target="_blank" rel="noreferrer"
 
>&lt;em>generative adversarial networks&lt;/em>&lt;/a>).&lt;span class="margin-note" data-note="no likelihood is ever computed; the discriminator *is* the loss function, and it is learned">
 &lt;span class="margin-note-indicator">𐃏&lt;/span>
&lt;/span>

the framework is treated in ch. 20 of (Goodfellow, Ian, 2016).&lt;/p></description></item></channel></rss>