{
  "schema_version": 1,
  "builder_plan": {
    "scenario": "Your self-hosted model spends too long generating answers token by token.",
    "change": "Check whether a compatible draft model and serving integration exist before renting compute.",
    "baseline": "The same target with speculation off, then your existing drafter if you have one.",
    "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": "Accepted draft length, tokens per second, tail latency, output quality, and total GPU cost.",
    "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.23818",
  "title": "Acceptance Is Not Speed: Length Inflation in Training-Free Lossy Speculative Decoding",
  "summary": "The recommendation is to keep lossless verification in speculative decoding rather than adopting training-free relaxed (lossy) acceptance rules, and to evaluate decoding efficiency by wall-clock time, verifier rounds, and completion length instead of accepted tokens per round. Lossless verification preserves the target distribution at the cost of lower per-round acceptance, while relaxed rules inflate reasoning traces and can exhaust the token budget before a final answer is produced. Relaxed rules can fail by accepting low-probability draft tokens that extend completions, reduce verifier rounds at the price of substantial accuracy loss, and deliver no real latency improvement despite favorable headline acceptance metrics.",
  "rationale": "The paper shows that training-free relaxed verification rules, the only speculative-decoding variants accessible on constrained infrastructure, do not deliver their advertised speedups once completion length is accounted for, so the production-safe choice is lossless verification with honest efficiency metrics.",
  "technique": "Lossy relaxed verification in speculative decoding",
  "family": "decodificacao_especulativa",
  "recommendation": "adotar",
  "published": "2026-10-16",
  "as_of": "2026-10-19",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2610.23818",
  "independent_implementations": 1,
  "total_implementations": 2,
  "stars": 122,
  "citations": null,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "The recommendation is to keep lossless verification in speculative decoding rather than adopting training-free relaxed (lossy) acceptance rules, and to evaluate decoding efficiency by wall-clock time, verifier rounds, and completion length instead of accepted tokens per round. Lossless verification preserves the target distribution at the cost of lower per-round acceptance, while relaxed rules inflate reasoning traces and can exhaust the token budget before a final answer is produced. Relaxed rules can fail by accepting low-probability draft tokens that extend completions, reduce verifier rounds at the price of substantial accuracy loss, and deliver no real latency improvement despite favorable headline acceptance metrics.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.23818",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "At the most relaxed settings, relaxed verification accepts 1.34x as many tokens per round but produces 1.54x longer completions, largely offsetting apparent speedup; rules reducing verifier rounds show substantial accuracy drops.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.23818",
      "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": ""
}