{ "schema_version": 1, "builder_plan": { "scenario": "A self-hosted assistant is too expensive because its model uses most of the GPU memory.", "change": "Try the paper's supported lower-precision weights on a copy of your serving setup.", "baseline": "The same model at its original precision, on the same GPU.", "steps": [ "Locate the paper's implementation and check its license, model support, data needs, and hardware requirements. Stop here if you cannot obtain the required artifacts.", "Save a small set of representative product tasks and expected outcomes. Keep evaluation tasks out of any training or tuning, and choose quality and cost limits before running.", "Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.", "Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test." ], "measure": "Peak memory, task pass rate, latency, and total serving cost at the same context and load.", "decision": "Keep the change only if it meets your preselected quality and latency limits and improves the metric you care about after setup and operating costs. Otherwise retain the baseline. This is an exploration plan, not a validated recommendation." }, "builder_review": null, "arxiv_id": "2610.00694", "title": "How Divergence Becomes Decision Flips in Compressed Language Models", "summary": "Replaces KL divergence as the reported and decision-relevant distance between a compressed model and its dense reference when what matters is how many arg-max decisions flip. Costs nothing beyond computing per-token total variation (or a first-order statistic such as Hellinger distance) over a sample of outputs, which is feasible on a single GPU; no retraining or calibration is required. Can fail when transferring across distributions unlike the validation corpora: the ratio fell below one on a held-out code corpus for two of three newly tested models, so per-domain verification on the deployment data is still needed.", "rationale": "For a team shipping compressed models with a fixed GPU budget, swapping KL for total variation in compression reports is a zero-cost measurement change that directly predicts decision flips and speculative-decoding acceptance, with the caveat that the ratio must be rechecked on out-of-domain data such as code.", "technique": "Total variation as flip-rate proxy for compressed models", "family": "quantizacao", "recommendation": "adotar", "published": "2026-09-30", "as_of": "2026-10-18", "editorial_status": "indexed", "source_url": "https://arxiv.org/abs/2610.00694", "independent_implementations": 0, "total_implementations": 1, "stars": 0, "citations": 0, "claims": [ { "claim_id": "claim-01", "statement": "Replaces KL divergence as the reported and decision-relevant distance between a compressed model and its dense reference when what matters is how many arg-max decisions flip. Costs nothing beyond computing per-token total variation (or a first-order statistic such as Hellinger distance) over a sample of outputs, which is feasible on a single GPU; no retraining or calibration is required. Can fail when transferring across distributions unlike the validation corpora: the ratio fell below one on a held-out code corpus for two of three newly tested models, so per-domain verification on the deployment data is still needed.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.00694", "source_page": null, "source_excerpt": "" }, { "claim_id": "claim-02", "statement": "Flip rate tracks total variation at a ratio with median 1.05 across 802 model copies; KL misranks compressors whose flip rates differ by >=10% in 11% of cases versus 1% for total variation; in vLLM speculative decoding, teacher-forced total variation predicts greedy draft acceptance with 1.1-2.4% mean relative error without task-specific calibration.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.00694", "source_page": null, "source_excerpt": "" } ], "exposure_map": [ { "dimension": "quality", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "compute", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "latency", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "operations", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "compatibility", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "security", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "data_and_training", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "reproducibility", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" } ], "risks": [], "minimum_test": [], "open_questions": [], "independent_tests": [], "lab_reproductions": [], "report_available": false, "validation_tier": "unknown", "evidence_tier": "unknown", "infrastructure_basis": "unknown", "equations": [], "equations_status": "not_fetched", "core_kind": "", "equations_fetched_at": "", "equations_source_url": "", "equations_source_sha256": "", "exposures_reviewed_at": "", "exposures_source_sha256": "" }