{
  "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.09227",
  "title": "Quantize by Drift: Label-Free Mixed-Precision Post-Training Quantization for Text Embedders",
  "summary": "The method replaces relevance-label-based or search-based per-module sensitivity estimation for mixed-precision post-training quantization of text embedders with a label-free signal: quantize one module, re-encode the corpus, and measure how far output embeddings drift, then allocate precision additively under a packed-byte budget. It costs one quantization pass per module plus a full corpus re-encoding per measurement, with no labels, no search, and only modest engineering complexity. It can fail as an allocation objective: at the main budget it underperformed same-budget uniform precision on all three sealed embedders, so it is justified mainly at stressed budgets where uniform precision collapses, and fine-grained redistribution around a strong uniform operating point remains unresolved.",
  "rationale": "The label-free sensitivity signal is cheap and reproducible on constrained infrastructure, but the authors' own sealed evaluation shows drift-based allocation loses to uniform quantization at the main budget, so it merits workload-specific validation at aggressive budgets rather than direct adoption.",
  "technique": "Label-free drift-based mixed-precision PTQ for embedders",
  "family": "quantizacao",
  "recommendation": "testar",
  "published": "2026-10-06",
  "as_of": "2026-10-18",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2610.09227",
  "independent_implementations": 0,
  "total_implementations": 0,
  "stars": 0,
  "citations": 0,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "The method replaces relevance-label-based or search-based per-module sensitivity estimation for mixed-precision post-training quantization of text embedders with a label-free signal: quantize one module, re-encode the corpus, and measure how far output embeddings drift, then allocate precision additively under a packed-byte budget. It costs one quantization pass per module plus a full corpus re-encoding per measurement, with no labels, no search, and only modest engineering complexity. It can fail as an allocation objective: at the main budget it underperformed same-budget uniform precision on all three sealed embedders, so it is justified mainly at stressed budgets where uniform precision collapses, and fine-grained redistribution around a strong uniform operating point remains unresolved.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.09227",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "Configuration-level drift orders mixed-precision plans against held-out retrieval quality at macro Spearman 0.911 across five embedders; on three sealed held-out embedders it beats the prior LieQ criterion 3/3 at the main budget but is numerically below same-budget uniform precision on all three (-0.99, -0.85, -1.01 points).",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.09227",
      "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": ""
}