BranchLoRA: Efficient MoE-LoRA for MCIT

• BranchLoRA is an asymmetric Mixture-of-Experts Low-Rank Adaptation architecture that employs a shared trunk and specialized branch matrices to address parameter inefficiency.
• It uses task-specific routers and a top-k expert selection mechanism to optimize parameter utilization in multimodal continual instruction tuning.
• The design integrates flexible tuning-freezing to preserve previously learned knowledge while effectively adapting to new tasks.

BranchLoRA is an asymmetric Mixture-of-Experts (MoE) Low-Rank Adaptation (LoRA) architecture designed to enhance parameter efficiency and mitigate catastrophic forgetting in Multimodal Continual Instruction Tuning (MCIT) for Multimodal LLMs (MLLMs). By sharing a single "trunk" matrix across all tasks while maintaining specialized "branch" matrices for task subsets, BranchLoRA overcomes parameter inefficiency observed in previous MoE-LoRA approaches and introduces novel mechanisms such as flexible tuning-freezing, task-specific routers, and automatic task selection to support continual learning across diverse sequential vision–language tasks (Zhang et al., 31 May 2025).

1. Multimodal Continual Instruction Tuning and Motivation

MCIT addresses the challenge of incrementally adapting a frozen MLLM to a series of new multimodal tasks $t_1,\dots,t_T$, each defined by a natural language instruction, a training set, and a test set. The objective is to produce a single model $\mathcal{M}$ that, after sequentially tuning on data from $$\mathcal{D}_{t_1}^{\mathrm{train}},\dots,\mathcal{D}_{t_T}^{\mathrm{train}}$$, retains high performance on every $\mathcal{D}_{t_j}^{\mathrm{test}}$ for $j\leq T$.

The MoE-LoRA framework has been widely adopted in MCIT, where each feed-forward (FF) layer’s weight update is decomposed into $N$ independent low-rank LoRA adapters ("experts"), and a router determines the mixture allocation per input. Despite its advantages in isolating task-specific parameters and partially preventing catastrophic forgetting (CF), empirical analysis reveals that in MoE-LoRA, expert input matrices ($\bm{A}_j$) tend to collapse into a shared subspace while output matrices ($\bm{B}_j$) capture task diversity. This redundancy results in parameter inefficiency, as each task is unnecessarily allocated a full rank-$r/N$ factor for both $\bm{A}$ and $\mathcal{M}$0, although only $\mathcal{M}$1 genuinely reflects per-task variation.

2. Architecture and Mechanisms of BranchLoRA

BranchLoRA rectifies the architectural asymmetry inherent in MoE-LoRA. It introduces the following key design changes:

• Shared trunk matrix: A single matrix $\mathcal{M}$2 is shared across all tasks, capturing task-invariant computation.
• Branch matrices: Maintains $\mathcal{M}$3 task-specialized matrices $\mathcal{M}$4, each $\mathcal{M}$5, which specialize to subsets of tasks.
• Per-task routers: For each task $\mathcal{M}$6, a task-specific router parameter $\mathcal{M}$7 dispatches activations to the most relevant branches, producing a sparse distribution via softmax over top-$\mathcal{M}$8 pre-activations.
• Top-$\mathcal{M}$9 expert selection: Only the $$\mathcal{D}_{t_1}^{\mathrm{train}},\dots,\mathcal{D}_{t_T}^{\mathrm{train}}$$0 branches with highest scores participate per input, increasing parameter utilization and specialization.

The forward computation at each FF layer is

$$\mathcal{D}_{t_1}^{\mathrm{train}},\dots,\mathcal{D}_{t_T}^{\mathrm{train}}$$1

where $$\mathcal{D}_{t_1}^{\mathrm{train}},\dots,\mathcal{D}_{t_T}^{\mathrm{train}}$$2 is the frozen baseline weight, $$\mathcal{D}_{t_1}^{\mathrm{train}},\dots,\mathcal{D}_{t_T}^{\mathrm{train}}$$3 is the LoRA rank, and $$\mathcal{D}_{t_1}^{\mathrm{train}},\dots,\mathcal{D}_{t_T}^{\mathrm{train}}$$4 is the routing distribution specific to task $$\mathcal{D}_{t_1}^{\mathrm{train}},\dots,\mathcal{D}_{t_T}^{\mathrm{train}}$$5.

This asymmetric structure advances parameter efficiency without sacrificing the expressiveness required to learn task-specific behaviors.

3. Flexible Tuning–Freezing and Branch Specialization

To further counteract catastrophic forgetting, BranchLoRA employs a tuning-freezing mechanism. After training on task $$\mathcal{D}_{t_1}^{\mathrm{train}},\dots,\mathcal{D}_{t_T}^{\mathrm{train}}$$6, activation statistics from the router over $$\mathcal{D}_{t_1}^{\mathrm{train}},\dots,\mathcal{D}_{t_T}^{\mathrm{train}}$$7 identify the top-$$\mathcal{D}_{t_1}^{\mathrm{train}},\dots,\mathcal{D}_{t_T}^{\mathrm{train}}$$8 most-utilized branches ($$\mathcal{D}_{t_1}^{\mathrm{train}},\dots,\mathcal{D}_{t_T}^{\mathrm{train}}$$9), which are then frozen for subsequent tasks. This ensures that knowledge pertinent to previous tasks is maintained, while allowing unfrozen branches to remain adaptable.

During training on $\mathcal{D}_{t_j}^{\mathrm{test}}$0, the update rule enforces

$\mathcal{D}_{t_j}^{\mathrm{test}}$1

while $\mathcal{D}_{t_j}^{\mathrm{test}}$2 and $\mathcal{D}_{t_j}^{\mathrm{test}}$3 remain fully trainable. This mechanism facilitates both stability of past knowledge and adaptability to new tasks, and enables selective reactivation for knowledge transfer across tasks.

4. Inference-Time Task Selection and Automatic Routing

At inference, BranchLoRA operates without access to explicit task identity. To address this, it learns, for each task $\mathcal{D}_{t_j}^{\mathrm{test}}$4, paired keys $\mathcal{D}_{t_j}^{\mathrm{test}}$5 and $\mathcal{D}_{t_j}^{\mathrm{test}}$6 that are aligned to the image and text modality embeddings using a cosine-alignment loss

$\mathcal{D}_{t_j}^{\mathrm{test}}$7

Given a test sample’s image and text embeddings $\mathcal{D}_{t_j}^{\mathrm{test}}$8, the inference pipeline computes

$\mathcal{D}_{t_j}^{\mathrm{test}}$9

and routes the input through the corresponding task-specific router $j\leq T$0, selecting its top-$j\leq T$1 branches for the remainder of the computation. This automatic routing obviates the need for explicit task labels or oracle knowledge at inference.

5. Experimental Evaluation

BranchLoRA was empirically benchmarked on the CoIN continual-instruction-tuning suite, comprising eight sequential multimodal datasets: ScienceQA, TextVQA, ImageNet classification, GQA, VizWiz, RefCOCO family grounding, VQAv2, and OCR-VQA. Using LLaVA-1.5 as the backbone model (7B and 13B parameter variants), with LoRA rank $j\leq T$2, $j\leq T$3 experts, and $j\leq T$4 active branches per layer, the following results were achieved:

Model	ACC (%)	MAA (%)	BWT (%)	Trainable Params	Train Time/Batch (ms)
MoE-LoRA (7B)	37.13	42.76	-25.91	350M	62
BranchLoRA(7B)	44.20	49.94	-20.98	222M	51
MoE-LoRA (13B)	42.51	—	—	—	—
BranchLoRA(13B)	49.27	—	—	—	—

Where ACC is mean accuracy after all tasks, MAA is the mean accuracy over the trajectory, and BWT (backward transfer) measures forgetting (negative indicates loss). BranchLoRA reduced trainable LoRA parameters by approximately 37% and decreased training time per batch. Ablation studies confirmed that shared trunk design, dynamic sparse expert selection, tuning-freezing, and task-specific routers each contributed incrementally to performance, with the complete stack showing the strongest resistance to catastrophic forgetting (Zhang et al., 31 May 2025).

6. Implications, Limitations, and Future Directions

BranchLoRA exposes and exploits the representational asymmetry between input ($j\leq T$5) and output ($j\leq T$6) adapters, resulting in a more parameter-efficient architecture for sequential task adaptation. Empirical findings indicate up to 20% reduction in catastrophic forgetting and substantial improvement in continual-learning metrics relative to MoE-LoRA.

Current limitations include evaluation restricted to the CoIN benchmark and a fixed instruction-tuning regime. Areas for further exploration include extension to non-multimodal settings, application of advanced model-merging techniques, and validation across longer task sequences (Zhang et al., 31 May 2025). A plausible implication is that such architectural asymmetries may generalize to other domains within continual learning and adapter-based transfer learning frameworks.