I have been studying the BiLLM algorithm described in your paper, and I have a question regarding the claimed 1-bit compression achieved through the combination of three binary masks.
In the following algorithm, you proposed the residual approximation by using two binary representation.
I wonder if this method belongs to 2 bit rather than 1bit?
I have been studying the BiLLM algorithm described in your paper, and I have a question regarding the claimed 1-bit compression achieved through the combination of three binary masks.
In the following algorithm, you proposed the residual approximation by using two binary representation. I wonder if this method belongs to 2 bit rather than 1bit?