<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Compression Represents Intelligence Linearly · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2404.09937/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2404.09937/feed.xml" rel="self" type="application/rss+xml" /><item><title>Compression Represents Intelligence Linearly — mentioned by Hasz</title><link>https://news.ycombinator.com/item?id=50292056</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.09937:50292056</guid><pubDate>Thu, 29 Oct 2026 16:48:15 GMT</pubDate><description>&lt;p&gt;I really like the idea that compression is intelligence, there are so many tricks an interesting ideas related to it. A bunch of them are described in the article, but you can imagine a long tail of many more inscrutable tricks chained together to get really incredible shrinkage in data. Hutter prize (I think mentioned in a 3b1b video somewhere else in this thread) is a great example. Given this was written before advent of LLM, I would love to see someone throw openAI/Anthropic levels of compute at a similar problem to see what the swarm can produce. https://arxiv.org/html/2404.09937v1&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.09937/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Compression Represents Intelligence Linearly — mentioned by Legend2440</title><link>https://news.ycombinator.com/item?id=40262417</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.09937:40262417</guid><pubDate>Sun, 05 May 2024 05:10:03 GMT</pubDate><description>&lt;p&gt;LLMs blow away traditional compressors because they are very good predictors, and prediction and compression are the same operation. You can convert any predictor into a lossless compressor by feeding the output probabilities into an entropy coding algorithm. LLMs can get compression ratios as high as 95% (0.4 bits per character) on english text. https://arxiv.org/html/2404.09937v1&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.09937/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Compression Represents Intelligence Linearly — mentioned by jxy</title><link>https://news.ycombinator.com/item?id=40261840</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.09937:40261840</guid><pubDate>Sun, 05 May 2024 02:28:22 GMT</pubDate><description>&lt;p&gt;There was this: Compression Represents Intelligence Linearly, https://arxiv.org/html/2404.09937v1&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.09937/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Compression Represents Intelligence Linearly — HN submission</title><link>https://news.ycombinator.com/item?id=40052985</link><guid isPermaLink="false">urn:hackerpapers:submission:2404.09937:40052985</guid><pubDate>Tue, 16 Apr 2024 15:10:20 GMT</pubDate><description>&lt;p&gt;Compression Represents Intelligence Linearly&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2404.09937/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
