ReMix: Reinforcement Routing for Mixtures of LoRAs in LLM Finetuning
Paper: arXiv:2603.10160 — UIUC, Meta AI, Washington University — Lifelong Agents @ ICLR 2026 (Workshop)
Key points
- The bug: Mixture-of-LoRAs activates k LoRA experts per layer, but learnable softmax routing weights collapse so that only one LoRA effectively works — the other k−1 experts consume compute without contributing. Example: among 8 LoRAs, one weight reaches 0.933 while the rest sit at 0.003–0.022; ESS (effective support size) falls from ~4 at step 0 to 1 by step 1000, and the collapse is irreversible.
- Theoretical proof (Theorem 1): With i.i.d. Gaussian-initialized router parameters, softmax routing provably collapses — with 84.19% probability at most 2 of 8 LoRAs receive large weights. Softmax is inherently a winner-take-all operation, and training only reinforces the concentration seeded at initialization.
- Average accuracy is 2.82% above the strongest baseline, with 31% fewer active parameters than MixLoRA.
- Ablations: removing RLOO or top-k inference degrades accuracy; comparisons against equal-parameter rank-kr LoRA (64.22 vs 59.21 at k=4) confirm the router selects genuinely diverse expert subsets.
- Train-time scaling: increasing the number of sampled selections M improves GSM8K from 56.03% (M=2) to 58.83% (M=32), analogous to test-time scaling but applied during training. Training costs only ~10% more than MixLoRA while improving accuracy by ~16% relative.
- Diminishing returns beyond M=32; validated only on Llama 3 8B (unclear at 70B+).
- The router is a simple linear projection + softmax; MLP routers and dynamic k remain unexplored.
- Potential misreadings: the constant-weight fix is specific to LoRA routing collapse (standard MoE load balancing uses auxiliary losses and is a different problem), and RLOO's variance benefits diminish for very large M.
The ReMix solution: three counterintuitive design decisions
1. Constant weights instead of learnable weights. All k activated LoRAs share a fixed weight ω (ω = 2/(kr) for LoRA-type, 2/√(kr) for rsLoRA-type). This forces ESS = k, eliminating collapse. Contribution: y = Wx + ω · Σ B_i A_i x over the k selected experts.
2. Reinforcement learning for the non-differentiable router. Since expert selection is discrete, routing is framed as an RL problem: the router's softmax distribution is the policy, sampling k LoRAs without replacement is the action, and negative SFT loss is the reward.
3. RLOO variance reduction. The REINFORCE Leave-One-Out estimator weights each sampled selection by how much its loss deviates from the mean across M samples, which is unbiased and dramatically reduces gradient variance — ablations show standard REINFORCE is unstable without it.
At inference, top-k selection replaces sampling. Theorem 2 guarantees that if the router's sampled selection hits the optimal subset with probability > 1/2, top-k deterministically recovers the optimal subset.
Results (Llama 3 8B, equal parameter budgets)
| Method | GSM8K | HumanEval | ARC-c | Avg | Active Params | |---|---|---|---|---|---| | LoRA | 59.21 | 26.83 | 83.05 | 56.36 | 0.112B | | rsLoRA | 62.47 | 28.66 | 82.71 | 57.95 | 0.028B | | DoRA | 55.34 | 31.10 | 83.39 | 56.61 | 0.127B | | MixLoRA | 61.87 | 28.05 | 82.37 | 57.43 | 0.101B | | HydraLoRA | 62.47 | 20.12 | 82.71 | 55.10 | 0.084B | | ReMix | 65.66 | 32.93 | 83.73 | 60.77 | 0.070B |
Limitations and open questions
Reference: Qiu, R., Zeng, H., Xia, Y., et al. (2026). *ReMix: Reinforcement Routing for Mixtures of LoRAs in LLM Finetuning*. arXiv:2603.10160.