<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="../assets/xml/rss.xsl" media="all"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Asymptotic Labs (Posts about PCA)</title><link>http://asymptoticlabs.com/</link><description></description><atom:link href="http://asymptoticlabs.com/categories/pca.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2022 &lt;a href="mailto:quidditymaster@gmail.com"&gt;Tim Anderton&lt;/a&gt; </copyright><lastBuildDate>Wed, 31 Aug 2022 21:28:37 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Glimpses of the Sudoku-tope</title><link>http://asymptoticlabs.com/posts/glimpses-of-the-sudoku-tope.html</link><dc:creator>Tim Anderton</dc:creator><description>&lt;div class="cell border-box-sizing text_cell rendered"&gt;&lt;div class="prompt input_prompt"&gt;
&lt;/div&gt;&lt;div class="inner_cell"&gt;
&lt;div class="text_cell_render border-box-sizing rendered_html"&gt;
&lt;p&gt;If you could see into the high dimensional abstract space of all possible sudoku boards what would it look like?&lt;/p&gt;
&lt;p&gt;&lt;img src="http://asymptoticlabs.com/images/glimpses-of-the-sudoku-tope-teaser.png" alt="sudokutope teaser image"&gt;&lt;/p&gt;
&lt;p&gt;&lt;a href="http://asymptoticlabs.com/posts/glimpses-of-the-sudoku-tope.html"&gt;Read more…&lt;/a&gt; (33 min remaining to read)&lt;/p&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/body&gt;&lt;/html&gt;
</description><category>group theory</category><category>PCA</category><category>sudoku</category><category>symmetry</category><guid>http://asymptoticlabs.com/posts/glimpses-of-the-sudoku-tope.html</guid><pubDate>Sat, 06 Feb 2021 07:00:00 GMT</pubDate></item><item><title>PCA and probabilities</title><link>http://asymptoticlabs.com/posts/pca-and-probabilities.html</link><dc:creator>Tim Anderton</dc:creator><description>&lt;div tabindex="-1" id="notebook" class="border-box-sizing"&gt;
    &lt;div class="container" id="notebook-container"&gt;

&lt;div class="cell border-box-sizing text_cell rendered"&gt;&lt;div class="prompt input_prompt"&gt;
&lt;/div&gt;
&lt;div class="inner_cell"&gt;
&lt;div class="text_cell_render border-box-sizing rendered_html"&gt;
&lt;p&gt;Principal Component Analysis (PCA) is frequently applied in machine learning as a sort of black box dimensionality reduction technique. PCA can be arrived at as an expression of a best fit probability distribution for our data. Treating PCA as a probability distribution opens up all sorts of fruitful avenues, we can draw new examples from the learned distribution and/or evaluate the likelihood of samples as we observe them to detect outliers.&lt;/p&gt;
&lt;p&gt;&lt;a href="http://asymptoticlabs.com/posts/pca-and-probabilities.html"&gt;Read more…&lt;/a&gt; (35 min remaining to read)&lt;/p&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/body&gt;&lt;/html&gt;
</description><category>anomaly detection</category><category>generative models</category><category>PCA</category><category>probability</category><guid>http://asymptoticlabs.com/posts/pca-and-probabilities.html</guid><pubDate>Tue, 10 Apr 2018 06:00:00 GMT</pubDate></item><item><title>Eigen-Techno</title><link>http://asymptoticlabs.com/posts/eigen-techno.html</link><dc:creator>Tim Anderton</dc:creator><description>&lt;div class="cell border-box-sizing text_cell rendered"&gt;&lt;div class="prompt input_prompt"&gt;
&lt;/div&gt;&lt;div class="inner_cell"&gt;
&lt;div class="text_cell_render border-box-sizing rendered_html"&gt;
&lt;p&gt;I recently found an analysis of techno music using principal component analysis (PCA).&lt;/p&gt;
&lt;p&gt;&lt;a href="https://www.math.uci.edu/~isik/posts/Eigentechno.html"&gt;https://www.math.uci.edu/~isik/posts/Eigentechno.html&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;The author, Umut Isik, extracted more than 90,000 clips of one bar worth of music from 10,000 different techno music tracks and stretched the music to all have the same tempo of 128 bpm. Then Isik fed those tracks through PCA and then analyzed the resulting principal vectors and the quality of music approximation with a growing number of components. Since the principal vectors are modeling sound we can listen to them which is rather fun. I won't cover all the same material as Isik did in that post and it is worth a read so nip over and give it a look if you haven't already. Isik has very kindly bundled up the source data and made it available for others to use (theres a link at the end of the post linked above). Playing around with such a fun data set is too tempting to resist so I'm going to do my own "eigentechno" analysis here.&lt;/p&gt;
&lt;p&gt;&lt;a href="http://asymptoticlabs.com/posts/eigen-techno.html"&gt;Read more…&lt;/a&gt; (31 min remaining to read)&lt;/p&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/body&gt;&lt;/html&gt;
</description><category>audio</category><category>music</category><category>PCA</category><guid>http://asymptoticlabs.com/posts/eigen-techno.html</guid><pubDate>Mon, 26 Mar 2018 14:24:13 GMT</pubDate></item><item><title>Low Rank Approximation On Sparsely Observed Data</title><link>http://asymptoticlabs.com/posts/slra_sparse_obs.html</link><dc:creator>Tim Anderton</dc:creator><description>&lt;div tabindex="-1" id="notebook" class="border-box-sizing"&gt;
    &lt;div class="container" id="notebook-container"&gt;

&lt;div class="cell border-box-sizing text_cell rendered"&gt;&lt;div class="prompt input_prompt"&gt;
&lt;/div&gt;
&lt;div class="inner_cell"&gt;
&lt;div class="text_cell_render border-box-sizing rendered_html"&gt;
&lt;h2 id="Intermezzo:-Sparsely-Observed-Data"&gt;Intermezzo: Sparsely Observed Data&lt;a class="anchor-link" href="http://asymptoticlabs.com/posts/slra_sparse_obs.html#Intermezzo:-Sparsely-Observed-Data"&gt;¶&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;In the post on &lt;a href="http://asymptoticlabs.com/posts/other_use_for_PCA_part2.html"&gt;using PCA for data imputation&lt;/a&gt; we used a weight for each of our data points. By assigning a weight of 0 to missing data and a weight of 1 to the rest of our data we managed to be able to get a reasonably good approximation to what we would find using PCA on the dataset without any data missing.&lt;/p&gt;
&lt;p&gt;This is fine when evaluating a dense model for our data matrix is not too much computational overhead. However when our input data are sparsely observed, that is to say most of our data consists of missing values then evaluating the model densely is a tremendous waste of computational resources. &lt;/p&gt;&lt;p&gt;&lt;a href="http://asymptoticlabs.com/posts/slra_sparse_obs.html"&gt;Read more…&lt;/a&gt; (23 min remaining to read)&lt;/p&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/body&gt;&lt;/html&gt;
</description><category>machine learning</category><category>mathjax</category><category>PCA</category><category>reccommender systems</category><category>sparsity</category><guid>http://asymptoticlabs.com/posts/slra_sparse_obs.html</guid><pubDate>Thu, 26 Oct 2017 06:00:00 GMT</pubDate></item><item><title>Imputing Missing Values With PCA</title><link>http://asymptoticlabs.com/posts/other_use_for_PCA_part2.html</link><dc:creator>Tim Anderton</dc:creator><description>&lt;div tabindex="-1" id="notebook" class="border-box-sizing"&gt;
    &lt;div class="container" id="notebook-container"&gt;

&lt;div class="cell border-box-sizing text_cell rendered"&gt;&lt;div class="prompt input_prompt"&gt;
&lt;/div&gt;
&lt;div class="inner_cell"&gt;
&lt;div class="text_cell_render border-box-sizing rendered_html"&gt;
&lt;h2 id="Uses-For-PCA-Other-Than-Dimensionality-Reduction-Part-2"&gt;Uses For PCA Other Than Dimensionality Reduction Part 2&lt;a class="anchor-link" href="http://asymptoticlabs.com/posts/other_use_for_PCA_part2.html#Uses-For-PCA-Other-Than-Dimensionality-Reduction-Part-2"&gt;¶&lt;/a&gt;&lt;/h2&gt;&lt;h3 id="Imputation,-and-Noise-Reduction"&gt;Imputation, and Noise Reduction&lt;a class="anchor-link" href="http://asymptoticlabs.com/posts/other_use_for_PCA_part2.html#Imputation,-and-Noise-Reduction"&gt;¶&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;Principal Component Analysis (PCA) is frequently applied in machine learning as a sort of black box dimensionality reduction technique. However with a deeper understanding of what PCA is and what it does we can use it for all manner of other tasks e.g.&lt;/p&gt;
&lt;p&gt;&lt;a href="http://asymptoticlabs.com/posts/other_use_for_PCA_part2.html"&gt;Read more…&lt;/a&gt; (30 min remaining to read)&lt;/p&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/body&gt;&lt;/html&gt;
</description><category>dimensionality reduction</category><category>imputation</category><category>mathjax</category><category>PCA</category><guid>http://asymptoticlabs.com/posts/other_use_for_PCA_part2.html</guid><pubDate>Thu, 07 Sep 2017 06:00:00 GMT</pubDate></item><item><title>Uses for PCA other than dimensionality reduction part 1</title><link>http://asymptoticlabs.com/posts/other_uses_for_PCA_part1.html</link><dc:creator>Tim Anderton</dc:creator><description>&lt;div tabindex="-1" id="notebook" class="border-box-sizing"&gt;
    &lt;div class="container" id="notebook-container"&gt;

&lt;div class="cell border-box-sizing text_cell rendered"&gt;&lt;div class="prompt input_prompt"&gt;
&lt;/div&gt;
&lt;div class="inner_cell"&gt;
&lt;div class="text_cell_render border-box-sizing rendered_html"&gt;
&lt;h2 id="Uses-For-PCA-Other-Than-Dimensionality-Reduction-Part-I"&gt;Uses For PCA Other Than Dimensionality Reduction Part I&lt;a class="anchor-link" href="http://asymptoticlabs.com/posts/other_uses_for_PCA_part1.html#Uses-For-PCA-Other-Than-Dimensionality-Reduction-Part-I"&gt;¶&lt;/a&gt;&lt;/h2&gt;&lt;h3 id="Decorrelation,-Factor-Discovery,-and-Noise-Modeling"&gt;Decorrelation, Factor Discovery, and Noise Modeling&lt;a class="anchor-link" href="http://asymptoticlabs.com/posts/other_uses_for_PCA_part1.html#Decorrelation,-Factor-Discovery,-and-Noise-Modeling"&gt;¶&lt;/a&gt;&lt;/h3&gt;&lt;p&gt;Principal Component Analysis (PCA) is frequently applied in machine learning as a sort of black box dimensionality reduction technique. However with a deeper understanding of what PCA is and what it does we can use it for all manner of other tasks e.g.&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Decorrelating Variables&lt;/li&gt;
&lt;li&gt;Semantic Factor Discovery&lt;/li&gt;
&lt;li&gt;Empirical Noise Modeling&lt;/li&gt;
&lt;li&gt;Missing Data Imputation &lt;/li&gt;
&lt;li&gt;Example Generation &lt;/li&gt;
&lt;li&gt;Anomaly Detection&lt;/li&gt;
&lt;li&gt;Patchwise Modeling&lt;/li&gt;
&lt;li&gt;Noise Reduction&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;We will demonstrate how to use PCA for these purposes on an example face dataset. In this first post we will handle up till empirical noise modeling and handle the rest in subsequent parts.&lt;/p&gt;
&lt;p&gt;&lt;a href="http://asymptoticlabs.com/posts/other_uses_for_PCA_part1.html"&gt;Read more…&lt;/a&gt; (31 min remaining to read)&lt;/p&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/body&gt;&lt;/html&gt;
</description><category>mathjax</category><category>Noise Modeling</category><category>PCA</category><guid>http://asymptoticlabs.com/posts/other_uses_for_PCA_part1.html</guid><pubDate>Thu, 31 Aug 2017 06:00:00 GMT</pubDate></item></channel></rss>