arXiv paper· machine learning (LLM efficiency and quantisation)· empirical study

Perplexity Cost Understates What Activation Quantisation Breaks

Anish Sathyanarayanan

cs.LG

Quick verdict

Claims perplexity can mask capability-specific quantisation damage; matched controls are strong, but probe noise and an unmatched repair temper the evidence.

Summary

The paper asks whether perplexity, the standard aggregate gate for post-training quantisation, identifies which computations activation quantisation actually damages. Using forward-hook quantisation of the residual stream at one block across 12 decoder models from four families (Pythia, GPT-2, Gemma-2, Qwen3), evaluated with three random-token probes (induction, at-distance copying, retrieval) and matched Gaussian-noise controls, the author shows that where perplexity rises only 1.2–1.5×, retrieval retains just 0.554 of intact accuracy while induction keeps 0.959 (Table 2), although perplexity still ranks arms reliably (violations in 2.1%/4.0% of 780 comparisons). Sign-randomised and token-shuffled error substitutes are as harmless as noise, so error magnitude alone does not explain the damage; granularity modulates a 'structure premium' reaching 299.92 at two bits per token. A random or QuaRot Hadamard rotation restores induction from 0.001 to 0.980 at three average bits single-block and reaches 0.968 end-to-end at four bits, with weaker retrieval recovery (0.694 and 0.534); deployed AWQ at W4A4 reproduces the induction/retrieval split on two models. Stated limitations: retrieval is statistically unresolved at this sample size, the bootstrap resamples only four models, the rotation repair lacks an MSE-matched control, and one mechanistic discrepancy (Appendix C) went unresolved.

Review complete

Assessment at a glance

machine learning (LLM efficiency and quantisation)

5

risk flags identified

● high 0

● medium 3

● low 2

Reproducibility readinessmedium
Code & data availableyes
Review confidencehigh
AI text signal0/20 passages flagged
Deep research viableCode-reproducibleNeeds GPU

5 strengths · 5 weaknesses · 5 author questions

AI text signal = Binoculars zero-shot detector score over 20 sampled passages (Fast-DetectGPT co-reported) — absence does not prove human authorship, and a flag does not imply misconduct.

Levels reflect verification complexity — not a quality score. Evolve never rates your paper.

Key claims under review

  • Perplexity reliably ranks quantisation arms (violations in only 2.1% and 4.0% of 780 within-model comparisons) but at 1.2–1.5× perplexity induction retains 0.959 of intact accuracy while retrieval retains only 0.554, so the aggregate hides capability-specific failure.
  • Quantisation damage is not explained by error magnitude: matched Gaussian noise and sign-randomised error with exact per-coordinate magnitudes preserve far more capability than the quantiser itself.
  • The damage is coordinate-aligned: quantising in a random or Hadamard-rotated basis restores induction from 0.001 to 0.980 at 3 average bits single-block and reaches 0.968 end-to-end at 4 bits, while a Fisher-sensitivity-protected subspace fails as a repair.
  • The induction/retrieval split reappears under deployed AWQ at W4A4 on pythia-1.4b (16.5% vs 2.8% retained) and Qwen3-8B-Base (86.3% vs 18.8%), though not under GPTQ W4A4, which damages both probes together.

Strengths

  • Matched-control design isolates error structure from magnitude

    Per-channel-second-moment Gaussian noise, sign-randomised errors (|ε| exact) and token-shuffled errors (Table 11) all reproduce almost none of quantisation's excess perplexity (e.g. 0.164 vs 0.173 at 4 bits), directly falsifying the diagonal noise account of Equation 1; a 0–100% sign-resampling dial (Table 12) recovers capability monotonically rather than jumping between endpoints.

  • Calibration of aggregate vs capability is quantified, not just asserted

    780 within-model comparisons show perplexity ranks arms reliably (2.1%/4.0% inversions), while the dose-response bands of Table 2 (induction 0.959 vs retrieval 0.554 at 1.2–1.5× perplexity) and the CKA result (0.916 similarity at 7.4-million-fold perplexity) expose what the aggregate misses.

  • Causal intervention supports the coordinate-alignment account

  • External validation on deployed quantisers with negative cases reported

  • Unusual candour in self-reporting

Weaknesses

  • Headline retrieval numbers rest on an underpowered probe

  • Between-model uncertainty comes from only four clusters

  • Repair benefit shrinks in the end-to-end regime most relevant to deployment

  • Rotation repair lacks an MSE-matched control

  • Per-tensor structure-premium rows are confounded

Full Review Report

$1.99 · one-time

Unlock the complete preliminary analysis Evolve produced for this paper.

Report preview

Scope & Claims

The paper (single author, BITS Pilani Goa) studies a narrowly framed but consequential question: does perplexity, the default gating metric for post-training activation quantisation, detect capability-specific damage? The setting is deliberately narrower than deployment: a forward hook quantises the residual-stream activation at one block (uniform symmetric, per-token default granularity, three relative depths), with an end-to-end variant quantising every block onward. The claims are explicit and mostly well-scoped: (1) perplexity reliably ranks arms (violations in only 2.1%/4.0% of 780 within-model comparisons) yet at 1.2–1.5× perplexity retrieval retains only 0.554 while induction keeps 0.959 (Table 2); (2) magnitude alone does not explain damage — matched Gaussian noise, sign-randomised and token-shuffled substitutes are nearly harmless (Table 11); (3) the damage is coordinate-aligned — rotation restores induction 0.001→0.980 at 3 bits (Table 3); (4) the split reappears under deployed AWQ at W4A4 (Table 5). The authors explicitly disclaim offering a new quantisation method or a universal theory.

The remaining sections cover Methodology Assessment, Statistical Evidence, Results & Reproducibility, Limitations & Risks, and Verdict & Recommendations.

  • All 5 strengths & 5 weaknesses, analyzed in detail
  • 5 risk flags with severity, section & reviewer questions
  • Methods & statistical evidence assessment
  • 5 questions a peer reviewer would ask
  • Full six-dimension evaluation report & recommendations

One-time purchase · this paper only

One-time purchase, this paper only. AI-generated preliminary analysis — not peer review.

Frequently asked questions

Does a low-perplexity quantised LLM mean the model is unharmed?

Not necessarily, according to this paper. In its experiments, settings where perplexity rose only 1.2–1.5× still lost over 40% of a key-value retrieval capability (retrieval retained 0.554 of intact accuracy), even though induction-style copying stayed near intact (0.959). Perplexity ranked quantisation settings reliably on average, but did not reveal which specific computations had been damaged.

Why doesn't matched random noise of the same size cause the same damage as quantisation?

The paper's core control: Gaussian noise matched to the quantisation error's per-channel magnitude, and even a version of the quantisation error with only its signs randomised, left far more of induction and retrieval intact than the actual quantiser. The damage therefore depends on the error's structure — it is aligned with the model's coordinate basis — not on its size. Quantising in a rotated basis largely removes the damage, supporting this account.

Does 4-bit quantisation break retrieval in real deployed methods?

In the tested configurations, weight-only 4-bit (W4A16) GPTQ and AWQ already degraded retrieval somewhat (e.g. Qwen3-8B-Base under AWQ: perplexity 19.9→21.0 while retrieval fell 0.480→0.383). When AWQ pushed activations to 4 bits (W4A4), the induction/retrieval split reappeared sharply: Qwen3-8B-Base kept 86.3% of induction but only 18.8% of retrieval. GPTQ at W4A4 damaged both probes together, so the effect depends on the specific quantiser.

What fixes the damage from activation quantisation?

Rotating the representation before quantising — either a random orthogonal matrix or QuaRot's Hadamard construction — restores induction from 0.001 to 0.980 at 3 average bits in the single-block setting, and reaches 0.968 end-to-end at 4 bits (retrieval recovers less: 0.694 and 0.534). Protecting high-magnitude or high-loss-sensitivity channels did not work as a repair. The measured cost of the diagnostic dense rotation was 51–75% per block; a fused kernel would be cheaper.

About this review

This is an AI-generated preliminary review by Evolve.Pub, produced from the openly available text of the paper. It is not peer review and does not represent the authors' views. The canonical record of the paper is at the publisher link above.

  • Figures (1–12) are not analysable from the extracted text; only their captions and in-text descriptions were used.
  • Several appendix tables are referenced (e.g. Tables 24–26 resolved per family) but only summary statistics are available for some cells.
  • The code link appears as a placeholder ('Code is available here') in the extracted abstract; actual repository availability was not verifiable.
  • Sections 5 and 7 feature-level numbers are medians over families with differing released dictionaries, so cross-family feature claims could not be independently checked from the text.

Go deeper on this paper

Wrote a paper? Stress-test it before reviewers do.

Upload your manuscript for the same structured scrutiny — reasoning, statistics, evidence, figures, and reproducibility.

Scan your paper
Perplexity Cost Understates What Activation Quantisation Breaks | Evolve.Pub