← Latest papers
🤖 machine learning

OffQ: Taming Structured Outliers in LLM Quantization by Offsetting

OffQ is a novel low-bit quantization method that mitigates activation outliers in large language models by identifying a low-dimensional outlier subspace via top-1 PCA, rotating high-magnitude activations into a single channel, and converting their magnitude into a shared offset to enable efficient and accurate W4A4KV4 quantization.

Original authors: Haoqi Wang, Lorenz K. Mueller, Jiawei Zhuang, Mathieu Salzmann, Lukas Cavigelli

Published 2026-06-08
📖 5 min read🧠 Deep dive

Original authors: Haoqi Wang, Lorenz K. Mueller, Jiawei Zhuang, Mathieu Salzmann, Lukas Cavigelli

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you have a massive, incredibly detailed library of knowledge (a Large Language Model, or LLM). To make this library fit into a small backpack so you can carry it on a phone or a laptop, you need to shrink the books. This process is called quantization.

Usually, you shrink the books by rounding off the tiny details, turning complex numbers into simple, whole numbers (like turning 4.99 into 5). This saves a huge amount of space.

The Problem: The "Screamers"
However, there's a catch. In these libraries, most pages are calm and quiet, but a few pages contain "screamers"—extremely loud, chaotic numbers that are way bigger than everything else.

  • If you try to shrink the whole library to fit in a small box, these "screamers" force you to use a very coarse grid.
  • It's like trying to fit a giant elephant and a tiny mouse into the same small crate. To fit the elephant, you have to crush the mouse into a tiny, unrecognizable lump.
  • In technical terms, these "screamers" (activation outliers) ruin the accuracy of the model because the rounding errors become too big for the quiet parts of the data.

The Old Solutions
Previous attempts to fix this were like trying to solve the elephant-and-mouse problem by:

  1. Learning a new way to shrink: Training the model again to be better at shrinking (expensive and slow).
  2. Using different sized crates: Keeping the elephant in a big box and the mouse in a small one (mixed precision). This works but makes the packing process complicated and slow.
  3. Using weird, custom boxes: Making special boxes that don't fit standard shelves (non-uniform quantization), which most computers can't handle easily.

The New Solution: OffQ
The paper introduces a new method called OffQ. Instead of fighting the screamers or using different boxes, OffQ uses a clever trick to "cancel out" the screamers.

Here is how OffQ works, step-by-step, using a simple analogy:

1. Finding the "Screamers" (Top-1 PCA)

First, OffQ looks at the data to find exactly where the "screamers" are hiding.

  • The Analogy: Imagine a crowded room where everyone is whispering, except for one person screaming in the corner. Standard methods might get confused by all the whispering. OffQ uses a special "Top-1" radar that ignores the whispers and zooms in only on the loudest scream.
  • The Result: It identifies that these screamers all follow a specific pattern and can be grouped together into a single "loud channel."

2. Moving the "Screamers" to One Spot (Rotation)

Once found, OffQ rotates the data so that all the screaming energy is concentrated into just one single channel (like moving all the screaming people into one specific seat in a theater).

  • The Analogy: Instead of having a few people screaming in different rows, you move them all to the front row, seat number 1. Now, the rest of the theater is perfectly quiet.

3. The Magic "Offset" Trick (Hadamard Rotation)

This is the core innovation. OffQ takes that one "loud seat" and uses a mathematical rotation (called a Hadamard rotation) to spread that loud noise evenly across every seat in the theater.

  • The Analogy: Imagine the loud noise from seat 1 is actually a giant, heavy blanket. Instead of leaving it on seat 1 (where it blocks the view), OffQ cuts the blanket into tiny, equal pieces and drapes a tiny piece over every single seat in the room.
  • The Result: No single seat is overwhelmed anymore. The "noise" is now a tiny, constant background hum that is the same for everyone.

4. Absorbing the Noise (Quantization)

Because the noise is now a constant, equal hum across the whole room, the quantization process (the shrinking) can simply say, "Okay, we know there's a tiny hum everywhere. Let's just adjust our zero-point to ignore it."

  • The Analogy: It's like telling the librarian, "We know the room is slightly dusty. Just subtract a tiny bit of dust from every book's weight, and now they all fit perfectly in the small backpack."
  • The Outcome: The "screamers" are effectively neutralized. The model can now be shrunk down to 4-bit (very small) without losing its ability to understand language.

Why This Matters

  • No Special Hardware Needed: Unlike other methods that require custom, complicated computer chips, OffQ works with standard, uniform boxes. It's like using standard shipping containers instead of custom-built crates.
  • Better Accuracy: The paper shows that OffQ keeps the library's knowledge much more accurate than previous methods, even when shrinking it down to the smallest size (4-bit for weights, activations, and memory).
  • Efficiency: It doesn't require retraining the model or using extra memory for different types of boxes. It just rearranges the data and adjusts the "zero point."

In Summary
OffQ is a clever packaging trick. Instead of letting a few "loud" numbers ruin the whole shipment, it isolates them, spreads their effect evenly across the entire package, and then adjusts the scale so the package fits perfectly into a tiny, efficient box without breaking the contents. This makes running powerful AI models on everyday devices much more feasible.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →