{
  "schema_version": 1,
  "builder_plan": {
    "scenario": "You already need task-specific training and want to reduce its memory or compute cost.",
    "change": "Change only the training technique on a small controlled run after checking prerequisites.",
    "baseline": "Your current training recipe with the same model, data split, and evaluation.",
    "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": "Held-out quality, peak memory, training time, and full compute cost to the target quality.",
    "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.22883",
  "title": "ToPA: Block-wise Toeplitz Adaptation for Expressive and Efficient Fine-Tuning",
  "summary": "ToPA replaces low-rank (LoRA-style) or sparse update matrices with products of block-wise Toeplitz matrices, which impose no explicit rank or sparsity constraint and can approximate arbitrary updates with short factor chains. The cost is a non-standard parameterization: it is not supported by mainstream PEFT libraries, so adoption requires integrating custom code, and per-layer parameter count and compute depend on block size and chain length, which must be tuned against a LoRA baseline. It can fail if gradient instability persists for deeper chains, if the expressivity gain does not transfer to the reader's specific task, or if the method remains a research-stage implementation without maintained tooling.",
  "rationale": "The method targets exactly the reader's setting of fine-tuning under constrained infrastructure, but its claimed advantage over LoRA is unquantified and it lacks mature library support, so it merits a small benchmark against a LoRA baseline rather than direct production adoption.",
  "technique": "Block-wise Toeplitz adaptation for PEFT",
  "family": "treino_eficiente",
  "recommendation": "testar",
  "published": "2026-10-16",
  "as_of": "2026-10-19",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2610.22883",
  "independent_implementations": 0,
  "total_implementations": 1,
  "stars": 122,
  "citations": null,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "ToPA replaces low-rank (LoRA-style) or sparse update matrices with products of block-wise Toeplitz matrices, which impose no explicit rank or sparsity constraint and can approximate arbitrary updates with short factor chains. The cost is a non-standard parameterization: it is not supported by mainstream PEFT libraries, so adoption requires integrating custom code, and per-layer parameter count and compute depend on block size and chain length, which must be tuned against a LoRA baseline. It can fail if gradient instability persists for deeper chains, if the expressivity gain does not transfer to the reader's specific task, or if the method remains a research-stage implementation without maintained tooling.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.22883",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "The authors claim ToPA consistently outperforms existing low-rank and sparse PEFT parameterizations and narrows the gap to full fine-tuning across 21 NLP and CV datasets and 5 architectures, but the abstract provides no quantified factor.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.22883",
      "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": ""
}