{ "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": "2609.31009", "title": "G$^2$PTQ: Improving LLM Post-Training Quantization with Generalized Gradient Compensation", "summary": "G2PTQ replaces GPTQ-style layer-wise or fixed-Hessian global PTQ by refreshing first- and second-order estimates before each Transformer block under a globally supervised objective, with trust-region scaling to bound gradient-driven weight updates. It costs more computation during quantization than standard GPTQ (repeated gradient and Hessian estimation plus block-wise compensation), though it requires no retraining and the code is public; the quantized model's inference cost is unchanged. It can fail if the exact gradient compensation destabilizes on models or calibration data where the trust-region heuristic is mistuned, and as a new method it lacks the deployment track record of GPTQ.", "rationale": "PTQ runs on a single 24 GB GPU and directly serves the reader's memory constraints, but as a newly published method its claimed accuracy advantage over mature GPTQ baselines must be validated on the reader's specific models and bit-widths before production adoption.", "technique": "Gradient-compensated block-wise post-training quantization", "family": "quantizacao", "recommendation": "testar", "published": "2026-09-25", "as_of": "2026-10-18", "editorial_status": "indexed", "source_url": "https://arxiv.org/abs/2609.31009", "independent_implementations": 0, "total_implementations": 1, "stars": 121, "citations": null, "claims": [ { "claim_id": "claim-01", "statement": "G2PTQ replaces GPTQ-style layer-wise or fixed-Hessian global PTQ by refreshing first- and second-order estimates before each Transformer block under a globally supervised objective, with trust-region scaling to bound gradient-driven weight updates. It costs more computation during quantization than standard GPTQ (repeated gradient and Hessian estimation plus block-wise compensation), though it requires no retraining and the code is public; the quantized model's inference cost is unchanged. It can fail if the exact gradient compensation destabilizes on models or calibration data where the trust-region heuristic is mistuned, and as a new method it lacks the deployment track record of GPTQ.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2609.31009", "source_page": null, "source_excerpt": "" }, { "claim_id": "claim-02", "statement": "Outperforms state-of-the-art PTQ baselines and better aligns with the full-precision model across model families and bit-widths; the abstract reports no numeric figures.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2609.31009", "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": "" }