<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Svd on Aayush Bajaj's Augmenting Infrastructure</title><link>https://abaj.ai/tags/svd/</link><description>Recent content in Svd 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:12 +1000</lastBuildDate><atom:link href="https://abaj.ai/tags/svd/index.xml" rel="self" type="application/rss+xml"/><item><title>Linear Algebra</title><link>https://abaj.ai/wiki/mathematics/linear-algebra/</link><pubDate>Thu, 09 Jul 2026 21:02:56 +1000</pubDate><guid>https://abaj.ai/wiki/mathematics/linear-algebra/</guid><description>&lt;p>linear algebra is the study of vector spaces and the structure-preserving maps between them. it is the one branch of mathematics that computers execute natively — every model fit, every graphics frame, every pagerank iteration is matrix arithmetic — and the local model that calculus reduces every smooth problem to.&lt;span class="margin-note" data-note="the jacobian on the multivariable page is exactly this reduction: differentiate, then hand the problem to linear algebra.">
 &lt;span class="margin-note-indicator">𐃏&lt;/span>
&lt;/span>

the plot of this page: spaces, then maps, then the four subspaces every matrix carries, then the two great factorisations — the spectral theorem and the svd (Anton, Howard, 2010).&lt;/p></description></item><item><title>Principal Component Analysis (PCA)</title><link>https://abaj.ai/wiki/ml/unsupervised/pca/</link><pubDate>Thu, 09 Jul 2026 21:02:56 +1000</pubDate><guid>https://abaj.ai/wiki/ml/unsupervised/pca/</guid><description>&lt;p>pca is the linear algebra exam question that escaped into industry. given a cloud of points in \(\mathbb{R}^d\), it finds the orthogonal directions along which the cloud spreads the most, and lets you throw away the rest.&lt;span class="margin-note" data-note="invented by pearson in 1901, reinvented by hotelling in 1933, reinvented weekly by graduate students ever since">
 &lt;span class="margin-note-indicator">𐃏&lt;/span>
&lt;/span>

two apparently different questions — &amp;ldquo;which directions carry the most variance?&amp;rdquo; and &amp;ldquo;which subspace loses the least when i project onto it?&amp;rdquo; — turn out to have the same answer, and that answer is an eigendecomposition.&lt;/p></description></item></channel></rss>