<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Latent-Space on Aayush Bajaj's Augmenting Infrastructure</title><link>https://abaj.ai/tags/latent-space/</link><description>Recent content in Latent-Space on Aayush Bajaj's Augmenting Infrastructure</description><generator>Hugo</generator><language>en</language><copyright>© 2026 Aayush Bajaj</copyright><lastBuildDate>Thu, 09 Jul 2026 21:02:27 +1000</lastBuildDate><atom:link href="https://abaj.ai/tags/latent-space/index.xml" rel="self" type="application/rss+xml"/><item><title>Autoencoders</title><link>https://abaj.ai/wiki/ml/dl/autoencoders/</link><pubDate>Thu, 09 Jul 2026 21:02:56 +1000</pubDate><guid>https://abaj.ai/wiki/ml/dl/autoencoders/</guid><description>&lt;p>an autoencoder is a network trained to do the one thing that sounds useless: output its own input. the trick is the obstacle course in the middle — a bottleneck, a corruption, a penalty — that makes verbatim copying impossible, so the network is forced to learn &lt;em>what about the input is worth keeping&lt;/em>.&lt;span class="margin-note" data-note="supervision without labels: the data is its own target, and the architecture is the teacher">
 &lt;span class="margin-note-indicator">𐃏&lt;/span>
&lt;/span>

the family tree below runs from the linear special case (which is &lt;a
 href="https://abaj.ai/wiki/ml/unsupervised/pca/"
 
 
>pca&lt;/a> wearing a trenchcoat) to the variational autoencoder, which turns the whole construction into a generative model (Goodfellow, Ian, 2016).&lt;/p></description></item></channel></rss>