Structured Transforms for Low-Overhead Quantization of Language Models
The proposed greedy algorithm with alternating updates guarantees the four-peak distribution required for stable 2-bit clustering of each factor and admits closed-form initialization of cluster centers, removing the multi-restart k-means bottleneck of prior work.
Daria Cherniuk, A. Rudikov, B. Kashin et al.
· 0 citations