提出动态路由的局部化低秩专家模型,解决多任务下参数冲突问题。
Localized LoRA-MoE: Block-wise Low-Rank Experts With Adaptive Routing

- 按块或单元级动态分配专家,实现自适应任务切换
- 在传感器故障下仍保持95%以上性能稳定
- 适合需要快速适应新任务的实时系统
大语言模型与高维感知网络日益依赖参数高效微调(PEFT)以适配多样场景。但标准方法如LoRA因单一瓶颈结构易受梯度战争影响,多任务流可能引发破坏性优化反馈,使适配器权重退化为无特性的平均值。尽管已有空间划分方法引入块级隔离,仍受限于静态拓扑,无法应对动态任务切换或环境传感器失效。本文提出局部化LoRA-MoE框架,融合局部空间分块与动态上下文感知路由。设计两种新架构:块级LoRA-MoE(集中式宏路由),通过全局上下文信号调控整体结构;单元级LoRA-MoE(去中心化微路由),赋予矩阵网格中每个坐标单元自主专家门控能力。在涵盖高维SVD矩阵模拟、真实表格转换及传感器退化下的空间视觉感知等多类基准测试中,两类架构均有效解决静态基线中的优化死锁问题。实验表明,去中心化单元级路由在统计上等价于全局协调器,提供强健的“梯度防火墙”,防止故障传播导致路径污染。所提方案持续优于静态基线,在细粒度坐标域与动态运行模式下实现可扩展、参数高效的模型适应。
原文摘要 · Abstract (English)
Large Language Models (LLMs) and high-dimensional perception networks increasingly rely on parameter-efficient fine-tuning (PEFT) to adapt to diverse operational contexts. However, standard methods like LoRA are structurally limited by a monolithic bottleneck, making them highly susceptible to gradient warfare. Interleaved multi-task streams may trigger destructive optimization feedback, collapsing adapter weights into unspecialized averages. While recent spatial partitioning methods have introduced block-wise isolation, they remain trapped in static topologies, unable to adapt to dynamic task-switching or environmental sensor failure. In this work, we introduce Localized LoRA-MoE, a unified framework that fuses localized spatial blocking with dynamic, context-conditioned routing. We propose and evaluate two novel architectural paradigms: Block-Wise LoRA-MoE (Centralized Macro-Routing), which modulates the entire structural grid via a monolithic context signal, and Cell-Wise LoRA-MoE (Decentralized Micro-Routing), which empowers every coordinate cell in the matrix grid with autonomous, localized expert gating. Through a comprehensive suite of benchmarks, ranging from high-dimensional SVD matrix simulations and real-world tabular transformations to spatial vision perception under sensor degradation, we demonstrate that both architectures resolve optimization deadlocks inherent in static baselines. Our empirical results establish that decentralized cell-level gating achieves complete statistical parity with an omniscient global coordinator, providing a robust "gradient firewall" that protects surviving pathways from fault-propagated corruption. Our proposals consistently outperform static baselines, offering a scalable and parameter-efficient solution for dynamic model adaptation across granular coordinate fields and shifting operational regimes.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。