FASQ: Flexible Accelerated Subspace Quantization for Calibration-Free LLM Compression
Not on the map. Why?
Abstract (arXiv)
Compressing large language models (LLMs) for deployment on commodity GPUs remains challenging: conventional scalar quantization is limited to fixed bit-widths (e.g., 8/4/3-bit), offers only a few discrete compression points, and typically requires calibration data. We present FASQ (Flexible Accelerated Subspace Quantization), a calibration-free framework that applies product quantization to LLM weight matrices. By tuning two parameters, sub-vector size and codebook cardinality, FASQ exposes a continuous design space spanning 27-49% of the original FP16 model size, filling compression gaps that fixed-bit schemes cannot reach. On Meta-Llama-3-8B, FASQ surpasses 4-bit GPTQ and AWQ in accuracy (67.1-67.7 avg.) at 37-42% model size, with consistent results on Qwen3-8B and Qwen3.5-9B-Base. To make product quantization practical at inference time, we design custom CUDA kernels: a LUT-free direct-compute GEMV for decode and an output-stationary double-buffered LUT GEMM for prefill, both with split-K parallelism. On an RTX~3090, FASQ achieves 45.2 tok/s decode at effective 4-bit (2.56x memory reduction) and 51.8 tok/s at effective 3-bit (2.80x), both surpassing FP16 tensor-core performance (43.9 tok/s) and delivering 1.6 to 1.8x the throughput of AWQ, 2.5 to 2.5x of GPTQ, and 4.3 to 5x of RTN. FASQ is the only compressed method that accelerates decode beyond FP16, offering calibration-free compression, continuous size-quality trade-offs, and real-time inference on a single consumer GPU.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 20 of its 31 references that are in the map. First posted on arXiv 22 Apr 2026.
Builds on
20 of 31 references.
References · 20
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
- 2023QuIP: 2-Bit Quantization of Large Language Models With Guaranteescited by 397
- 2019Differentiable Product Quantization for End-to-End Embedding Compressioncited by 36
- 2021Multiplying Matrices Without Multiplyingcited by 30
- 2023LUT-NN: Empower Efficient Neural Network Inference with Centroid Learning and Table Lookupcited by 19
- 2025LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Acceleratorcited by 8
8 more
- 2022PECAN: A Product-Quantized Content Addressable Memory Networkcited by 6
- 2024MicroNAS: Zero-Shot Neural Architecture Search for MCUscited by 5
- 2024MONAS: Efficient Zero-Shot Neural Architecture Search for MCUscited by 4
- 2025COBRA: Algorithm-Architecture Co-optimized Binary Transformer Accelerator for Edge Inferencecited by 4
- 2024TG-NAS: Generalizable Zero-Cost Proxies with Operator Description Embedding and Graph Learning for Efficient Neural Architecture Searchcited by 2
- 2025Q-ROAR: Outlier-Aware Rescaling for RoPE Position Interpolation in Quantized Long-Context LLMscited by 2
- 2024Optimized Spatial Architecture Mapping Flow for Transformer Acceleratorscited by 1
- 2025PD-Swap: Prefill-Decode Logic Swapping for End-to-End LLM Inference on Edge FPGAs via Dynamic Partial Reconfigurationcited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.