通过联邦LoRA加随机丢弃提升大模型泛化能力,降低训练开销。
FedLoDrop: Federated LoRA with Dropout for Generalized LLM Fine-tuning
- 在联邦学习的LoRA矩阵中引入行与列的随机丢弃,增强模型泛化性。
- 理论证明高丢弃率可降低泛化误差上界,但需平衡经验误差上升问题。
- 设计优化算法在资源受限边缘设备上高效求解最优丢弃率与资源分配。
微调大语言模型对适配通用模型至特定任务至关重要,可在极少资源下提升准确性和相关性。为进一步增强泛化能力并降低训练成本,本文提出联邦LoRA加丢弃(FedLoDrop)框架,在联邦LoRA的可训练矩阵中引入行与列的随机丢弃。在稀疏正则化条件下,获得了泛化误差上界与收敛性分析,揭示了欠拟合与过拟合之间的根本权衡。误差上界表明,更高的丢弃率会增加模型稀疏度,从而降低点态假设稳定性(PHS)的上界,虽缩小了经验误差与泛化误差的差距,但也会导致更高的经验误差,二者共同决定整体泛化误差。尽管丢弃能减少通信开销,但在网络边缘部署仍受资源限制。为此,构建优化问题以最小化泛化误差上界,联合优化丢弃率与资源分配,满足延迟与单设备能耗约束。提出基于分支定界(B&B)的方法求得全局最优解;为降低计算复杂度,进一步设计基于惩罚式连续凸逼近(P-SCA)的算法,高效获取高质量次优解。数值结果验证了该方法在缓解过拟合、提升泛化能力方面的有效性。
原文摘要 · Abstract (English)
Fine-tuning (FT) large language models (LLMs) is crucial for adapting general-purpose models to specific tasks, enhancing accuracy and relevance with minimal resources. To further enhance generalization ability while reducing training costs, this paper proposes Federated LoRA with Dropout (FedLoDrop), a new framework that applies dropout to the rows and columns of the trainable matrix in Federated LoRA. A generalization error bound and convergence analysis under sparsity regularization are obtained, which elucidate the fundamental trade-off between underfitting and overfitting. The error bound reveals that a higher dropout rate increases model sparsity, thereby lowering the upper bound of pointwise hypothesis stability (PHS). While this reduces the gap between empirical and generalization errors, it also incurs a higher empirical error, which, together with the gap, determines the overall generalization error. On the other hand, though dropout reduces communication costs, deploying FedLoDrop at the network edge still faces challenges due to limited network resources. To address this issue, an optimization problem is formulated to minimize the upper bound of the generalization error, by jointly optimizing the dropout rate and resource allocation subject to the latency and per-device energy consumption constraints. To solve this problem, a branch-and-bound (B\&B)-based method is proposed to obtain its globally optimal solution. Moreover, to reduce the high computational complexity of the B\&B-based method, a penalized successive convex approximation (P-SCA)-based algorithm is proposed to efficiently obtain its high-quality suboptimal solution. Finally, numerical results demonstrate the effectiveness of the proposed approach in mitigating overfitting and improving the generalization capability.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。