Skip to content
Conference Open access

Fast and Accurate Fisher-Guided Quantization via Efficient Kronecker Factorization

2026 · Annual Meeting of the Association for Computational Linguistics · pp. 38925-38935 · 0 citations · 24 references
Computer Science

TL;DR

This work proposes an efficient Kronecker-factored approximation yielding state-of-the-art performance when integrated into existing quantization schemes, and substantially accelerates the most expensive component in second-order quantization – Hessian parameterization – achieving up to a 10× speedup over prior approaches.

Abstract

Quantization has shown strong results in preserving model quality under compression. However, under aggressive bit-width reductions, even quantization may require additional information to prevent performance degradation. A natural source of it is the second-order curvature information, captured by the Hessian. Since the Hessian of the model layers is pro-hibitively large, direct computation is infeasible, making structured parameterizations and approximations crucial in practice. In this work, we propose an efficient Kronecker-factored approximation yielding state-of-the-art performance when integrated into existing quantization schemes. Evaluations on the LLaMA and Qwen model families show near-baseline quality at 4-bit compression and only a 5–6% degradation at 2-bit for models with 7–8B parameters. Moreover, our method substantially accelerates the most expensive component in second-order quantization – Hessian parameterization – achieving up to a 10× speedup over prior approaches. Quantized model checkpoints are available at https://huggingface.co/collections/ timo13113/fastkron-collection .

Read PDF

Similar papers

Preprint Aug 2026

BaKron: Efficient Quantization with Kronecker-Factored Hessians

BaKron is an efficient solver that combines anti-diagonal parallelism with a recursive divide-and-conquer construction that matches the cubic scaling of GPTQ while exploiting richer curvature information.

Johann Birnick, R. Saab · 2 citations
Jul 2026

Stable FP4 Training via Transposition-Invariant Block Quantization

This work proposes a low-precision training framework based on 2D block FP4 quantization, which enforces transposition-invariant scaling and preserves consistency between forward and backward computations, and combines this with truncation-free scaling and stochastic rounding to control quantization error and maintain...

Mehdi Rahimifar, Amin Darabi, Mehran Taghian Jazi et al. · 2 citations
Conference Open access Sep 2026

Budget-Aware LLM Quantization and Low-Rank Correction via Information-Guided Subspace Matrices

A training-free framework, BAL-ANCER, which achieves global budget allocation for mixed-precision quantization and low-rank correction through information-guided subspace matrices, allowing a principled greedy allocator to distribute compression bits and ranks across the entire model.

Si-Nuo Fan, Ying-Jie Lao · 0 citations
Preprint Aug 2026

HAMP-LIC: Hessian-Aware Mixed-Precision Post-Training Quantization for Learned Image Compression

HAMP-LIC is proposed, a Hessian-aware mixed-precision post-training quantization (PTQ) framework with a four-stage optimization strategy that consistently outperforms existing fixed- and mixed-precision PTQ methods across multiple datasets while completely eliminating cross-platform encoding-decoding errors.

Yuefeng Zhang · 0 citations
Preprint Aug 2026

Compression Trinity: Exploring Sparsity, Quantization, and Low-Rank Approximations for LLM Compression

Prohibitive computational and environmental costs impede the scalable deployment of Large Language Models (LLMs). Traditional compression techniques (sparsity, quantization, low-rank approximations) are typically applied in isolation, and each hits an accuracy-efficiency wall. This thesis proposes the"Compression Trini...

Mohammad Mozaffari · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.