Peter Bloem<p>Solving ARC (well... up to 20%) with inference-time compression. Another indication that <a href="https://sigmoid.social/tags/MDL" class="mention hashtag" rel="tag">#<span>MDL</span></a> and <a href="https://sigmoid.social/tags/AlgorithmicComplexity" class="mention hashtag" rel="tag">#<span>AlgorithmicComplexity</span></a> are becoming relevant in the age of Deep Learning. </p><p><a href="https://iliao2345.github.io/blog_posts/arc_agi_without_pretraining/arc_agi_without_pretraining.html" target="_blank" rel="nofollow noopener" translate="no"><span class="invisible">https://</span><span class="ellipsis">iliao2345.github.io/blog_posts</span><span class="invisible">/arc_agi_without_pretraining/arc_agi_without_pretraining.html</span></a></p>