<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Expectation-Maximisation on Aayush Bajaj's Augmenting Infrastructure</title><link>https://abaj.ai/tags/expectation-maximisation/</link><description>Recent content in Expectation-Maximisation on Aayush Bajaj's Augmenting Infrastructure</description><generator>Hugo</generator><language>en</language><copyright>© 2026 Aayush Bajaj</copyright><lastBuildDate>Fri, 10 Jul 2026 08:20:15 +1000</lastBuildDate><atom:link href="https://abaj.ai/tags/expectation-maximisation/index.xml" rel="self" type="application/rss+xml"/><item><title>Gaussian Mixture Models</title><link>https://abaj.ai/wiki/ml/unsupervised/gaussian-mixtures/</link><pubDate>Thu, 09 Jul 2026 21:02:56 +1000</pubDate><guid>https://abaj.ai/wiki/ml/unsupervised/gaussian-mixtures/</guid><description>&lt;p>a single gaussian is a committed statement: one bump, symmetric, thin tails. real data is usually several stories overlaid — different regimes, different subpopulations — and a gaussian mixture says so explicitly: each point was generated by &lt;em>one of&lt;/em> \(k\) gaussians, we just don&amp;rsquo;t get told which.&lt;span class="margin-note" data-note="the &amp;#39;don&amp;#39;t get told which&amp;#39; is the entire difficulty, and em is the entire answer">
 &lt;span class="margin-note-indicator">𐃏&lt;/span>
&lt;/span>

fitting one is the canonical latent-variable problem, and the algorithm that fits it — expectation-maximisation — is one of the great workhorses of statistics.&lt;/p></description></item></channel></rss>