Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 5 min ago
PreprintarXiv licencearXiv

Beyond Scalar Sensitivity: Activation-Aware Mixed-Precision LLM Quantization with Cross-Layer Refinement

Abstract

Mixed-precision weight quantization is commonly formulated as a Multiple-Choice Knapsack Problem (MCKP), yet existing solvers rely on scalar sensitivity proxies that collapse each weight matrix's Hessian into a single number and treat every module independently. We prove that even the optimal scalar proxy incurs multiplicative distortion up to √(κ(A)κ(B)) relative to the full activation-aware quadratic, where κ(A) and κ(B) denote the condition numbers of the input- and output-side Hessian factors. This bound varies from 101 to 1013 for typical LLM modules, making inter-module sensitivity ranking unreliable. To address these limitations, we propose Cross-layer Activation-aware Sensitivity Allocation (CASA), a two-phase method. In Stage 1, the scalar proxy is replaced by an activation-aware metric derived from the Kronecker-factored Hessian, reducing the MCKP to a form whose continuous relaxation admits a closed-form solution. In Stage 2, a cross-layer-aware local search evaluates bit-width updates using the end-to-end model loss. Experiments on multiple LLMs across different bit budgets show that CASA achieves lower perplexity than the latest scalar-proxy baselines, especially at ultra-low bit-widths (<3 bits per weight). Moreover, the performance gain in zero-shot accuracy tracks the per-model average condition-number over modules, confirming the distortion bound as a practical indicator of scalar-proxy failure.

Related

  1. Beyond Expert Rankings: Contrast Calibration for Mixed-Precision MoE Quantization
    Renjie Xie, Juncheng Yang, Aoting Hu +5
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. When Lower Reconstruction Loss Hurts: Distributionally Robust Refinement for Low-Bit LLM Quantization
    Yanlong Zhao, Xiaoyuan Cheng, Huihang Liu +6
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  3. SemKV: Semantic Mixed-Precision KV Cache Quantization Guided by the Quality Cliff for Long-Context LLM Inference
    Daeha Lee, Do-Hyung Kim, Jae-Hong Kim
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  4. Joint Branch-Space Transform Coding for Diffusion Activation Quantization with Classifier-Free Guidance
    Mingrun Jiang, Yuejia Liu, Zishan Shao +11
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  5. Beyond Shadow Weights: Quantization-Aware Training as Quantized-Endpoint Descent
    Sheng-An Xu, Hanyang Li, Jianhao Ma +1
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
BibTeX
@misc{yoshida2026beyond,
  title = {{Beyond Scalar Sensitivity: Activation-Aware Mixed-Precision LLM Quantization with Cross-Layer Refinement}},
  author = {Akihiro Yoshida and Yuma Ichikawa},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.25916},
  eprint = {2609.25916},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.25916},
}
RIS
TY  - UNPB
TI  - Beyond Scalar Sensitivity: Activation-Aware Mixed-Precision LLM Quantization with Cross-Layer Refinement
AU  - Akihiro Yoshida
AU  - Yuma Ichikawa
PY  - 2026
DA  - 2026/09/22
PB  - arXiv
DO  - 10.48550/arxiv.2609.25916
UR  - https://arxiv.org/abs/2609.25916
AB  - Mixed-precision weight quantization is commonly formulated as a Multiple-Choice Knapsack Problem (MCKP), yet existing solvers rely on scalar sensitivity proxies that collapse each weight matrix's Hessian into a single number and treat every module independently. We prove that even the optimal scalar proxy incurs multiplicative distortion up to √(κ(A)κ(B)) relative to the full activation-aware quadratic, where κ(A) and κ(B) denote the condition numbers of the input- and output-side Hessian factors. This bound varies from 10^1 to 10^13 for typical LLM modules, making inter-module sensitivity ranking unreliable. To address these limitations, we propose Cross-layer Activation-aware Sensitivity Allocation (CASA), a two-phase method. In Stage 1, the scalar proxy is replaced by an activation-aware metric derived from the Kronecker-factored Hessian, reducing the MCKP to a form whose continuous relaxation admits a closed-form solution. In Stage 2, a cross-layer-aware local search evaluates bit-width updates using the end-to-end model loss. Experiments on multiple LLMs across different bit budgets show that CASA achieves lower perplexity than the latest scalar-proxy baselines, especially at ultra-low bit-widths (<3 bits per weight). Moreover, the performance gain in zero-shot accuracy tracks the per-model average condition-number over modules, confirming the distortion bound as a practical indicator of scalar-proxy failure.
ER  -