{
  "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.10411",
  "title": "Training Parallel Speculative Draft Models by Directly Minimizing Expected Decoding Rounds",
  "summary": "EDR replaces block-local surrogate losses (e.g., per-position distillation-style objectives) for training parallel/semi-autoregressive speculative drafters with a Markov-reward-process objective that directly minimizes expected decoding rounds, plus an exact offline evaluator for drafter comparison. The cost is a more involved training pipeline: it requires target-model rollouts and a temporal-difference gradient estimator, adding implementation complexity and rollout compute beyond standard supervised finetuning. It can fail if the reader cannot run target-model rollouts for the production model (e.g., API-only targets with no logit access), if acceptance gains do not translate to wall-clock speedups on a memory-bound single GPU, or if the unbiased TD gradient has high variance in practice.",
  "rationale": "The method is a training recipe, not an inference-time drop-in, so it only matters if the reader trains drafters against an accessible target model; its claimed gains are consistent but unquantified in factor terms, warranting workload-specific validation before adoption.",
  "technique": "EDR objective for training parallel speculative drafters",
  "family": "decodificacao_especulativa",
  "recommendation": "testar",
  "published": "2026-10-07",
  "as_of": "2026-10-18",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2610.10411",
  "independent_implementations": 0,
  "total_implementations": 0,
  "stars": 0,
  "citations": null,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "EDR replaces block-local surrogate losses (e.g., per-position distillation-style objectives) for training parallel/semi-autoregressive speculative drafters with a Markov-reward-process objective that directly minimizes expected decoding rounds, plus an exact offline evaluator for drafter comparison. The cost is a more involved training pipeline: it requires target-model rollouts and a temporal-difference gradient estimator, adding implementation complexity and rollout compute beyond standard supervised finetuning. It can fail if the reader cannot run target-model rollouts for the production model (e.g., API-only targets with no logit access), if acceptance gains do not translate to wall-clock speedups on a memory-bound single GPU, or if the unbiased TD gradient has high variance in practice.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.10411",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "Finetuning DSpark and DFly with EDR consistently improves mean accepted length over existing training objectives across nine benchmarks; no multiplicative speedup factor is stated in the abstract.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.10411",
      "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": ""
}