English

IsoQuant: Hardware-Aligned SO(4) Isoclinic Rotations for LLM KV Cache Compression

Machine Learning 2026-03-31 v1 Computation and Language

Abstract

Orthogonal feature decorrelation is effective for low-bit online vector quantization, but dense random orthogonal transforms incur prohibitive O(d2)O(d^2) storage and compute. RotorQuant reduces this cost with blockwise 33D Clifford rotors, yet the resulting 33D partition is poorly aligned with modern hardware and offers limited local mixing. We propose \textbf{IsoQuant}, a blockwise rotation framework based on quaternion algebra and the isoclinic decomposition of SO(4)SO(4). It represents each 44D block as a quaternion and applies a closed-form transform T(v)=qLvqRT(v)=q_L v \overline{q_R}. This yields two main variants: \emph{IsoQuant-Full}, which realizes the full SO(4)SO(4) rotation, and \emph{IsoQuant-Fast}, which keeps only one isoclinic factor for lower cost; the framework also admits a lightweight 22D special case. At d=128d=128, IsoQuant-Full reduces forward rotation cost from about 2,4082{,}408 FMAs in RotorQuant to 1,0241{,}024, while IsoQuant-Fast further reduces it to 512512. Across 1818 fused CUDA settings with d128,256,512d \in {128,256,512}, bit widths 2,3,4{2,3,4}, and FP16/FP32 execution, IsoQuant achieves mean kernel-level speedups of about 4.5×4.5\times--4.7×4.7\times over RotorQuant while maintaining comparable reconstruction MSE, with peak speedups above 6×6\times. Current validation is limited to the stage-1 quantize--dequantize path on synthetic normalized vectors; end-to-end KV-cache evaluation remains future work.

Cite

@article{arxiv.2603.28430,
  title  = {IsoQuant: Hardware-Aligned SO(4) Isoclinic Rotations for LLM KV Cache Compression},
  author = {Zhongping Ji},
  journal= {arXiv preprint arXiv:2603.28430},
  year   = {2026}
}

Comments

11 pages

R2 v1 2026-07-01T11:44:07.170Z