{ "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.28072", "title": "MuPACE: Learning to Pace Muon for LoRA Fine-Tuning", "summary": "MuPACE replaces per-problem learning rate schedule tuning for LoRA fine-tuning with a small recurrent policy that adjusts the step size of an otherwise untouched Muon optimizer on top of an interpretable analytic schedule. The cost is the meta-training phase across a distribution of fine-tuning runs plus an extra recurrent controller in the training loop, though inference and the deployed adapter are unaffected. It can fail when the production task or model distribution differs sharply from the meta-training distribution, when the meta-training budget is unavailable to a small team, or when the claimed transfer does not hold for non-Qwen architectures or non-LoRA configurations.", "rationale": "Eliminating per-task LR sweeps directly saves GPU-hours on a constrained budget, but the method requires either a released pretrained policy or an amortized meta-training investment whose payoff depends on how often the team fine-tunes new tasks.", "technique": "Meta-learned learning rate pacing for Muon+LoRA", "family": "treino_eficiente", "recommendation": "testar", "published": "2026-10-20", "as_of": "2026-10-21", "editorial_status": "indexed", "source_url": "https://arxiv.org/abs/2610.28072", "independent_implementations": 0, "total_implementations": 0, "stars": 0, "citations": null, "claims": [ { "claim_id": "claim-01", "statement": "MuPACE replaces per-problem learning rate schedule tuning for LoRA fine-tuning with a small recurrent policy that adjusts the step size of an otherwise untouched Muon optimizer on top of an interpretable analytic schedule. The cost is the meta-training phase across a distribution of fine-tuning runs plus an extra recurrent controller in the training loop, though inference and the deployed adapter are unaffected. It can fail when the production task or model distribution differs sharply from the meta-training distribution, when the meta-training budget is unavailable to a small team, or when the claimed transfer does not hold for non-Qwen architectures or non-LoRA configurations.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.28072", "source_page": null, "source_excerpt": "" }, { "claim_id": "claim-02", "statement": "Outperforms strong shared-default fixed schedules on 64-78% of 64 fine-tuning problems and matches per-task tuned-peak schedules, with one-shot transfer to unseen tasks on models up to 64 layers (Qwen3-32B, Qwen3.8-27B).", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.28072", "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": "" }