Comment by FuckButtons

Comment by FuckButtons 8 hours ago

3 replies

why is this amazing, it’s just a 1 bit lossy compression representation of the original information? If you have a vector in n-dimensional space this is effectively just representing the basis vectors that the original has.

simonw 7 hours ago

You can take 8192 bytes of information (1024 x 32 bit floats) and reduce that to 128 bytes (1024 bits, a 64x reduction in size!) and still get results that are about 95% as good.

I find that cool and surprising.

  • computably 40 minutes ago

    1024 bits for a hash is pretty roomy. The embedding "just" has to be well-distributed across enough of the dimensions.

  • sa-code 7 hours ago

    I'm with you, it's very satisfying to see a simple technique work well. It's impressive