atlas

Research map / Architectures and efficiency / Quantization

PolarQuant: Leveraging Polar Transformation for Key Cache Quantization and Decoding Acceleration

NeurIPS 2025 · Architectures and efficiency › Quantization · approach: KV cache quantization · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes PolarQuant, which quantizes post-RoPE key cache by converting 2D key sub-vectors to polar coordinates (quantized radius and angle), and uses lookup tables with fused Triton kernels to speed up query-key products.

Problem

Key cache quantization in LLMs suffers from channel-wise outliers (amplified by RoPE), which degrade low-bit quantization and make decoding with quantized keys costly due to dequantization and RoPE recomputation.

Approach

Group key channels into 2D sub-vectors matching RoPE rotation pairs, convert them to polar coordinates, and quantize radius and angle separately with group-wise asymmetric quantization; the query-key inner product then becomes a lookup over the finite set of quantized 2D states, avoiding RoPE recomputation.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use PolarQuant 3/3 instead of KIVI-2Llama-3.1-8B-Instruct key cache · LongBenchaverage score: 48.68 -> 49.53Helped
Use PolarQuant 3/3 instead of KIVI-2Llama-2-7B-Chat key cache · LongBenchaverage score: 30.48 -> 31.20Helped
Use PolarQuant 4/4 instead of KIVI-4Qwen-2.5-1.5B-Instruct key cache · LongBenchaverage score: 36.53 -> 36.41Hurt
Use PolarQuant 4/4 instead of KIVI-4DeepSeek-R1-Distill-Qwen-1.5B key cache · Reasoning benchmarksoverall score: 45.30 -> 47.69Helped
Use PolarQuant 4/4 instead of ZipCache-4DeepSeek-R1-Distill-Llama-8B key cache · Reasoning benchmarksoverall score: 61.13 -> 62.44Helped
Use PolarQuant 3/3 instead of KIVI-2 with the custom QK kernelLlama-3.1-8B-Instruct decoding · 32K-context QK multiplication, batch size 8latency (s): 2.35 -> 1.03Helped
Set group size to 32 (ablation)PolarQuant 4/4 · LongBench, Llama-3.1-8B-Instructaverage score: 49.39 -> 49.50No clear effect
Set group size to 64 (ablation)PolarQuant 4/4 · LongBench, Llama-3.1-8B-Instructaverage score: 49.39 -> 49.33No clear effect
Set group size to 256 (ablation)PolarQuant 4/4 · LongBench, Llama-3.1-8B-Instructaverage score: 49.39 -> 49.58No clear effect
Allocate 5 bits to radii and 3 bits to angles (ablation)PolarQuant, 4.25-bit configuration · LongBench, Llama-3.1-8B-Instructaverage score: 49.39 -> 49.41No clear effect
Allocate 3 bits to radii and 5 bits to angles (ablation)PolarQuant, 4.25-bit configuration · LongBench, Llama-3.1-8B-Instructaverage score: 49.39 -> 49.51No clear effect
Allocate 4 bits to radii and 2 bits to angles (ablation)PolarQuant, 3.25-bit configuration · LongBench, Llama-3.1-8B-Instructaverage score: 49.53 -> 47.66Hurt

Surprising findings

Limitations

Experimental setup

Benchmarks: LongBench GSM8K AIME24 AIME25 MATH GPQA

Metrics: accuracy F1 score latency throughput memory usage

Baselines: Int-4 Int-3 ZipCache KIVI-4 KIVI-2 QJL SnapKV

Builds on: KIVI KVQuant RoPE ZipCache QJL

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy