Top
Best
New

Posted by matt_d 13 hours ago

Breaking the 1.58-bit Barrier for Ternary LLMs(arxiv.org)
203 points | 31 commentspage 2
ant6n 4 hours ago|
ternary is totally losslessly compressed anyway.

Why not just use an 8-bit LUT to encode the 256 most common ternary vectors with 6 components. That means of the possible 729 possible such vectors, you can only represent 256 different ones. You have to do more aggressive rounding, but at least the scheme is very simple to decompress and stream.

akoboldfrying 3 hours ago|
I think the weights are iid distributed, so all 729 patterns will be roughly equally likely. That doesn't make this a bad idea though -- it just means there's no point trying to select the most common 256 to keep, since any 256 will be roughly as good.
Kevcmk 12 hours ago||
Woah. Good science.
kittikitti 9 hours ago||
Thank you for sharing this. I like to test out running LLM's on edge computing with limited RAM and GPU/CPU so this research will have practical implications on my activities. I also appreciated how the authors formulated 1.58 (it's log_2(3)) because that was embarrassingly confusing for me when I was first introduced to ternary LLM's.
kadushka 11 hours ago||
[dead]
kadushka 12 hours ago|
[flagged]