Re:The Neuralink compression challenge seems impossible
by Terr_ on Friday May 31, 2024 @12:01AM
(#40531365)
You're missing the most important part: It entirely depends on what the data looks like.
For example, if you hand me a gigabyte of pure zeroes I can quickly compress that over a hundred-million-fold by hand. [0]
In contrast, if it's a patternless random distribution, you're gonna have a real bad time and you might as well not even bother.
> The state-of-the-art is only slightly better: the current winner of the Hutter Prize (http://prize.hutter1.net/), a nearly two decade old prize to encourage the development of better compressors, achieved compression by 9x. 200x is a pipe dream.
While I agree 200x sounds wonky, that 9x is for English text, so that numeric comparison is apples-to--uh, to mystery fruit.
[0] "Fine artisanal compression for the palate and palette of the discerning algo-gourmand." Pitch deck in progress.
For example, if you hand me a gigabyte of pure zeroes I can quickly compress that over a hundred-million-fold by hand. [0]
In contrast, if it's a patternless random distribution, you're gonna have a real bad time and you might as well not even bother.
> The state-of-the-art is only slightly better: the current winner of the Hutter Prize (http://prize.hutter1.net/), a nearly two decade old prize to encourage the development of better compressors, achieved compression by 9x. 200x is a pipe dream.
While I agree 200x sounds wonky, that 9x is for English text, so that numeric comparison is apples-to--uh, to mystery fruit.
[0] "Fine artisanal compression for the palate and palette of the discerning algo-gourmand." Pitch deck in progress.