mlsanityData to 14 Oct 2026

ITQ3_S: High-Fidelity 3-bit LLM Inference via Interleaved Ternary Quantization with Rotation-Domain Smoothing

arXiv 2603.27914 ↗First posted 30 Mar 2026cs.LG cs.AI cs.DCcited by 1

Not on the map. Why?

Abstract (arXiv)

We present ITQ3S (Interleaved Ternary Quantization -- Specialized), a novel 3-bit weight quantization format for LLMs integrating TurboQuant (TQ), a rotation-domain strategy based on the Fast Walsh-Hadamard Transform (FWHT). Conventional 3-bit methods suffer precision loss from heavy-tailed weight distributions and inter-channel outliers. ITQ3S pre-rotates the weight space via FWHT before quantization, spreading outlier energy across the vector and inducing a near-Gaussian distribution amenable to uniform ternary coding. We derive a rigorous dequantization procedure fusing a 256-point Inverse FWHT into the CUDA shared-memory loading stage, ensuring reconstruction error is bounded exclusively by the ternary quantization grid with no additional error from the transform inversion. For any weight vector w ∈ ℝ256, the reconstruction satisfies |hatw - w|2 ≤ εq, strictly smaller than uniform 3-bit baselines that do not exploit rotation-induced distribution normalization. TurboQuant lacks a native CUDA kernel, precluding direct deployment; naively composing TQ with existing weight quantizers introduces domain mismatch errors that accumulate across layers, degrading quality below standard 3-bit baselines. ITQ3S resolves this by co-designing the FWHT rotation and quantization kernel as a unified pipeline grounded in the IQ3S weight format, with the inverse transform fused into the CUDA MMQ kernel. Empirically, on the NVIDIA RTX 5090 (Blackwell), ITQ3S achieves perplexity competitive with FP16 while delivering throughput exceeding 1.5x that of 4-bit alternatives via optimized DP4A and Tensor Core scheduling. Our results establish ITQ3S as a practical, mathematically grounded solution for high-fidelity LLM deployment on consumer hardware.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 7 of its 10 references that are in the map. First posted on arXiv 30 Mar 2026.

Builds on

7 of 10 references.

References · 7

  1. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  2. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
  3. 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 906
  4. 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 526
  5. 2024QuIP#: Even Better LLM Quantization with Hadamard Incoherence and Lattice Codebookscited by 378
  6. 2023SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compressioncited by 367
  7. 2023SqueezeLLM: Dense-and-Sparse Quantizationcited by 294

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026CAT-Q: Cost-efficient and Accurate Ternary Quantization for LLMs
  2. 2024QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMs
  3. 2026Qift: Shift-Friendly No-Zero W2 Post-Training Quantization for Rotated W2A4/KV4 LLM Inference
  4. 2025WUSH: Near-Optimal Adaptive Transforms for LLM Quantization
  5. 2026XOR-Trellis: Ultra-Low-Complexity Dequantization and Curvature-Aware Hadamard-Free LLM Quantization
  6. 2026GRINQH: Graded Input-based Quantization Hierarchy for Efficient LLM Generation
  7. 2025SpecQuant: Spectral Decomposition and Adaptive Truncation for Ultra-Low-Bit LLMs Quantization
  8. 2025BTC-LLM: Efficient Sub-1-Bit LLM Quantization via Learnable Transformation and Binary Codebook