{
  "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.13215",
  "title": "Monarch-MoE: Structured Experts for Multimodal Continual Instruction Tuning",
  "summary": "Monarch-MoE replaces the dense low-rank factors in multi-expert LoRA adapters with block-diagonal factors joined by a fixed permutation, so each block-pair update touches only one output block and forgetting is reduced in multimodal continual instruction tuning. The cost is a custom implementation with batched computation, fused forward operators, and a specialized backward pass, plus method-dependent trade-offs in final-task performance; parameter savings are a side benefit rather than guaranteed speedups outside the evaluated setup. It can fail if the reader's workload is not continual multimodal instruction tuning of a ~7B VLM, since gains are validated only on MLLM-DCL and UCIT with LLaVA-1.5-7B, and the fixed permutation may underperform dense factors on other task sequences.",
  "rationale": "The method fits constrained infrastructure and shows strong retention gains, but its value is confined to continual multimodal tuning and needs validation on the reader's own task sequence before production adoption.",
  "technique": "Block-diagonal Monarch-structured LoRA experts for continual tuning",
  "family": "treino_eficiente",
  "recommendation": "testar",
  "published": "2026-10-09",
  "as_of": "2026-10-18",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2610.13215",
  "independent_implementations": 0,
  "total_implementations": 0,
  "stars": 0,
  "citations": null,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "Monarch-MoE replaces the dense low-rank factors in multi-expert LoRA adapters with block-diagonal factors joined by a fixed permutation, so each block-pair update touches only one output block and forgetting is reduced in multimodal continual instruction tuning. The cost is a custom implementation with batched computation, fused forward operators, and a specialized backward pass, plus method-dependent trade-offs in final-task performance; parameter savings are a side benefit rather than guaranteed speedups outside the evaluated setup. It can fail if the reader's workload is not continual multimodal instruction tuning of a ~7B VLM, since gains are validated only on MLLM-DCL and UCIT with LLaVA-1.5-7B, and the fixed permutation may underperform dense factors on other task sequences.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.13215",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "First-task forgetting as low as 0.52 percentage points on MLLM-DCL and 0.10 on UCIT with LLaVA-1.5-7B, while cutting adapter parameters by roughly 75% and 50% versus compared LoRA-expert baselines; runs on a single 24 GB RTX 4090.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.13215",
      "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": ""
}