解决边缘设备动态加入/退出时的模型修正难题。
Priority-Aware Learning-Unlearning Correction for Dynamic Decentralized LoRA Fine-Tuning

- 基于正交LoRA设计可独立增删参数的更新机制。
- 实测在设备进出场景下均能有效修正模型偏差。
- 适合资源受限的边缘智能系统快速响应变化。
随着大语言模型在边缘网络中部署以提供普适生成式AI服务,去中心化联邦学习(DFL)通过设备间高效参数更新实现隐私保护的领域定制化微调。然而,边缘网络中设备频繁动态加入或离开,要求系统持续适应新数据并选择性移除旧贡献。当前修正过程面临瓶颈:各设备更新已深度嵌入全局参数。为此,我们提出一种基于正交LoRA的优先级感知学习-遗忘修正框架,通过拓扑调整提升知识评估能力。首先设计正交LoRA机制,生成训练后贡献坐标,实现无历史依赖的参数增删。其次分析修正瓶颈,提出根据主导残差项选择拓扑优化、本地修正、近端阻尼或同步调度的优先级策略。进一步开发资源分配算法,在每轮无线约束下优先分配通信资源至关键层组。实验表明,该框架在设备加入与退出事件中均实现稳健的后期修正,且不同残差模式需采用不同修正动作。
原文摘要 · Abstract (English)
As large language models (LLMs) are increasingly deployed at the network edge to provide pervasive generative AI services, decentralized federated learning (DFL) provides a vital mechanism for privacy-preserving, domain-specific fine-tuning through peer-to-peer exchanges of parameter-efficient updates. However, the dynamic nature of practical decentralized edge networks, where devices may dynamically join or leave the collaborative training process, requires the system to continuously adapt to new data while selectively removing prior contributions. This correction process remains a significant bottleneck, as individual device updates become deeply entangled within the global fine-tuned parameters. To address this challenge, we propose a priority-aware learning-unlearning correction framework based on orthogonal LoRA that can enhance the knowledge evaluation through topology adjustment. Specifically, we first design an orthogonal LoRA mechanism that yields post-training contribution coordinates, enabling history-free projection addition and deletion in response to membership changes. We then analyze the correction bottleneck and develop a priority-aware policy that selects among topology refinement, local correction, proximal damping, and synchronization scheduling according to the dominant residual term. A resource allocation algorithm is further developed to allocate limited communication across layer groups, prioritizing the primary bottlenecks within per-round wireless constraints. Experiments demonstrate that the proposed framework achieves robust post-event correction for both device join and leave events and validate that different residual regimes necessitate distinct correction actions.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。