<story><title>Machine Learning, Kolmogorov Complexity, and Squishy Bunnies (2019)</title><url>http://theorangeduck.com/page/machine-learning-kolmogorov-complexity-squishy-bunnies</url></story><parent_chain></parent_chain><comment><author>manthideaal</author><text>Using Kolmogorov Complexity and then using PCA is not valid since you are approximating a solution and Kolmogorov Complexity is for exact solutions. Anyway perhaps there is, or should be defined, a signal&amp;#x2F;noise Kolmogorov Complexity measure, that is the shortest length of a  program that computes an approximate solution within an epsilon distance of the true solution. Also since PCA is discussed, why not use SVD?&lt;p&gt;Edited: See (1)for some related ideas: A Safe Approximation for Kolmogorov Complexity&lt;p&gt;(1) &lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;link.springer.com&amp;#x2F;chapter&amp;#x2F;10.1007&amp;#x2F;978-3-319-11662-4_24&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;link.springer.com&amp;#x2F;chapter&amp;#x2F;10.1007&amp;#x2F;978-3-319-11662-4_...&lt;/a&gt;</text></comment>
<story><title>Machine Learning, Kolmogorov Complexity, and Squishy Bunnies (2019)</title><url>http://theorangeduck.com/page/machine-learning-kolmogorov-complexity-squishy-bunnies</url></story><parent_chain></parent_chain><comment><author>woliveirajr</author><text>When I first learned about Kolmogorov complexity I understood it as the amount of symbols you have to use, from some specific vocabulary, to represent something.&lt;p&gt;It walks side-by-side with compression (and pigeon problems). Using Kolmogorov to improve ML in those physical examples means that the solution will be better to the specific case, not that there&amp;#x27;ll come a one-in-all solution to any kind of clothes animation.</text></comment>