提出TAD-LoRA,解决去中心化微调中通信拓扑导致的训练不稳问题。
Stabilizing Decentralized Federated Fine-Tuning via Topology-Aware Alternating LoRA
- 通过感知通信拓扑,交替协调LoRA参数更新与混合
- 在弱连通网络下性能显著提升,MNLI上表现突出
- 理论证明收敛性,适合动态通信环境下的模型微调
去中心化联邦学习(DFL)作为无服务器的联邦学习变体,在低秩适配(LoRA)的参数高效微调中面临独特挑战。由于LoRA的分解结构,去中心化聚合其更新会引入依赖拓扑的交叉项,可能导致动态通信图下的训练不稳定。本文提出TAD-LoRA框架,通过协调LoRA因子的更新与混合,控制客户端间的参数错位。理论证明了在非凸目标下TAD-LoRA的收敛性,明确刻画了拓扑引发的交叉项误差与块坐标表示偏差之间的权衡,该权衡由交替训练的切换间隔决定。在多种通信条件下实验验证分析,结果表明TAD-LoRA在不同通信场景下均具鲁棒性,在强连通拓扑下保持竞争力,并在中等和弱连通拓扑下带来明显提升,尤其在MNLI数据集上表现优异。
原文摘要 · Abstract (English)
Decentralized federated learning (DFL), a serverless variant of federated learning, poses unique challenges for parameter-efficient fine-tuning due to the factorized structure of low-rank adaptation (LoRA). Unlike linear parameters, decentralized aggregation of LoRA updates introduces topology-dependent cross terms that can destabilize training under dynamic communication graphs. We propose \texttt{TAD-LoRA}, a Topology-Aware Decentralized Low-Rank Adaptation framework that coordinates the updates and mixing of LoRA factors to control inter-client misalignment. We theoretically prove the convergence of \texttt{TAD-LoRA} under non-convex objectives, explicitly characterizing the trade-off between topology-induced cross-term error and block-coordinate representation bias governed by the switching interval of alternative training. Experiments under various communication conditions validate our analysis, showing that \texttt{TAD-LoRA} achieves robust performance across different communication scenarios, remaining competitive in strongly connected topologies and delivering clear gains under moderately and weakly connected topologies, with particularly strong results on the MNLI dataset.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。