Sub-1-Bit LLM Compression via Latent Factorization

(github.com)

59 points | by brainless 4 hours ago

6 comments

  • augment_me 1 hour ago
    Perf goes from 80% to 47% on Wikitext-2. Also no comparisons to FP4 solutions that are able to maintain or exceed perf on the same dataset 80% perf with a 4.25-4.5 big budget.

    I think more meaningful thing here would be a hybrid solution that went down to sub-bit representations when the informational representation does not need it (for example later layers) that still maintains task performance

  • big-chungus4 1 hour ago
    Can this produce a useful model? So far 1 bit quants have been less useful than smaller models that use the same memory
    • tcdent 19 minutes ago
      I don't think it's trying to be a useful implementation, but the significance they do provide is that they are able to improve on the relative loss at lower quants.

      So, not something anyone would want to run currently, but an indicator that there is still more to squeeze out of lower precisions.

      Trellis quantization is a far more approachable enhancement right now, but it doesn't cross the 1-bit barrier (and perhaps doesn't intend to).

    • GaggiX 1 hour ago
      I recently found this 1.58-bit model for ASR and it's surprising good (and very fast), that being said it's not a LLM.

      https://huggingface.co/moondream/parakeet-redux

  • badatnames 1 hour ago
    Their paper shows this comes with huge quality loss, but that doesn't make it a negative result by any means
  • bArray 50 minutes ago
    Has anybody tested this? Are there any available computed models to test?
  • nbutton762 1 hour ago
    Thought this was going to be on the original Little Bit paper, always nice to find out about a surprise sequel!
  • nico 1 hour ago
    Has anyone tried this on apple silicon M1-5? Any benchmarks/comps?