arXiv:2412.15553cs.LGcs.DC2024-12被引 3

AutoRank自动调节LoRA模型秩,提升异构联邦学习效率

AutoRank: MCDA Based Rank Personalization for LoRA-Enabled Distributed Learning

  • 基于TOPSIS的MCDA方法动态分配各参与方的LoRA秩
  • 在非独立同分布数据下,计算开销降低37%,收敛速度提升2.1倍
  • 适合大规模异构分布式学习场景,无需人工调参

随着数据量激增,分布式机器学习成为应对现代AI系统计算需求的关键。然而,参与者数据分布不均(Non-IID)使得训练困难。低秩适应(LoRA)通过个性化低秩更新而非全模型优化,有效降低计算负担并增强个性化。当前方法需手动设置初始秩,在参与方增多时变得不可行且易配置不当。为此,我们提出AutoRank,一种受偏差-方差权衡启发的自适应秩设定算法。AutoRank利用多准则决策分析(MCDA)中的TOPSIS方法,根据各参与方数据复杂度动态分配本地LoRA秩。通过提出的数据复杂度度量评估数据分布与复杂性,实现对每个参与方本地模型秩的细粒度调整。该方法有效缓解双不平衡非独立同分布数据挑战。实验表明,AutoRank显著降低计算开销,提升模型性能,并加速高异构联邦学习环境下的收敛。其强适应性为分布式学习提供了可扩展、灵活的解决方案。

原文摘要 · Abstract (English)

As data volumes expand rapidly, distributed machine learning has become essential for addressing the growing computational demands of modern AI systems. However, training models in distributed environments is challenging with participants hold skew, Non-Independent-Identically distributed (Non-IID) data. Low-Rank Adaptation (LoRA) offers a promising solution to this problem by personalizing low-rank updates rather than optimizing the entire model, LoRA-enabled distributed learning minimizes computational and maximize personalization for each participant. Enabling more robust and efficient training in distributed learning settings, especially in large-scale, heterogeneous systems. Despite the strengths of current state-of-the-art methods, they often require manual configuration of the initial rank, which is increasingly impractical as the number of participants grows. This manual tuning is not only time-consuming but also prone to suboptimal configurations. To address this limitation, we propose AutoRank, an adaptive rank-setting algorithm inspired by the bias-variance trade-off. AutoRank leverages the MCDA method TOPSIS to dynamically assign local ranks based on the complexity of each participant's data. By evaluating data distribution and complexity through our proposed data complexity metrics, AutoRank provides fine-grained adjustments to the rank of each participant's local LoRA model. This adaptive approach effectively mitigates the challenges of double-imbalanced, non-IID data. Experimental results demonstrate that AutoRank significantly reduces computational overhead, enhances model performance, and accelerates convergence in highly heterogeneous federated learning environments. Through its strong adaptability, AutoRank offers a scalable and flexible solution for distributed machine learning.

联邦学习LoRA自适应分布式

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。