{ "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": "2609.31600", "title": "New LoRA Skills Should Read but Never Write", "summary": "READ replaces weight-space merging of LoRA adapters, joint retraining on all task data, and per-task adapter routing with a sequential composition scheme: adapters are rewritten into a balanced canonical factorization, and a coupling matrix is trained so each new adapter can read old adapters' input subspaces without writing into their output subspaces, with the result folded into the base weights. The cost is training one coupling row per appended skill (cheap on a single 24 GB GPU), with zero added inference latency or memory, though composing skills still requires per-task LoRA training and access to task data at each append. It can fail if the reported gains do not transfer beyond the evaluated benchmark suites and model families, if the canonicalization or coupling training is sensitive to implementation details not yet replicated by third parties, or if old-skill interference reemerges for skills dissimilar to the tested sequences.", "rationale": "The method targets a real production need (combining task-specific LoRAs into one model with no routing or inference overhead) at a cost compatible with constrained infrastructure, but its large claimed gains come from a single recent paper and require independent validation on the reader's own task mix before production adoption.", "technique": "Read-only LoRA adapter composition (READ)", "family": "treino_eficiente", "recommendation": "testar", "published": "2026-09-25", "as_of": "2026-10-18", "editorial_status": "indexed", "source_url": "https://arxiv.org/abs/2609.31600", "independent_implementations": 0, "total_implementations": 1, "stars": 1, "citations": 0, "claims": [ { "claim_id": "claim-01", "statement": "READ replaces weight-space merging of LoRA adapters, joint retraining on all task data, and per-task adapter routing with a sequential composition scheme: adapters are rewritten into a balanced canonical factorization, and a coupling matrix is trained so each new adapter can read old adapters' input subspaces without writing into their output subspaces, with the result folded into the base weights. The cost is training one coupling row per appended skill (cheap on a single 24 GB GPU), with zero added inference latency or memory, though composing skills still requires per-task LoRA training and access to task data at each append. It can fail if the reported gains do not transfer beyond the evaluated benchmark suites and model families, if the canonicalization or coupling training is sensitive to implementation details not yet replicated by third parties, or if old-skill interference reemerges for skills dissimilar to the tested sequences.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2609.31600", "source_page": null, "source_excerpt": "" }, { "claim_id": "claim-02", "statement": "Improves every benchmark suite average over the strongest published adapter-composition baselines, by more than 20 points on SuperGLUE and more than 7 points on the domain suite, across two model families (absolute point gains, not multiplicative factors).", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2609.31600", "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": "" }