动态调整通信频率,让联邦微调更高效
FDA-Opt: Federated Fine-Tuning via Dynamic Update Schedules
- 根据训练进度动态调整模型更新频率,取代固定周期通信
- 在多个NLP任务上超越传统FedOpt,且无需额外调参
- 可直接替换现有系统,开箱即用提升性能
联邦学习(FL)使大规模、此前不可用的数据源得以利用。预训练语言模型(LM)展现出卓越的涌现能力,且易于适配下游任务,这为联邦微调开辟了重要前沿。然而,传统FL存在频繁且僵化的参数通信问题,尤其在大型现代模型中更为突出。尽管FedOpt系列算法已成为主流,依赖于固定的通信间隔,近期的FDA算法虽提出动态策略,但引入难调参数并强制同步机制。本文提出FDA-Opt算法族,统一融合FDA与FedOpt优势。实验聚焦于下游NLP任务上的语言模型微调,结果表明:即使在为FedOpt专门优化超参数的情况下,FDA-Opt仍表现更优。证明了FDA-Opt是现代联邦学习系统中无需额外配置即可直接替换FedOpt的实用方案,开箱即实现更高性能。
原文摘要 · Abstract (English)
Federated Learning (FL) enables the utilization of vast, previously inaccessible data sources. At the same time, pre-trained Language Models (LMs) have taken the world by storm and for good reason. They exhibit remarkable emergent abilities and are readily adapted to downstream tasks. This opens one of the most exciting frontiers in FL: fine-tuning LMs. Yet, a persistent challenge in FL is the frequent, rigid communication of parameters -- a problem magnified by the sheer size of these contemporary models. The FedOpt family of algorithms has become the go-to approach for FL, relying on fixed but arbitrary intervals for model exchanges. Recently, the FDA algorithm prescribed a dynamic approach by monitoring the training progress. However, it introduced a hard-to-calibrate parameter and imposed a rigid synchronization scheme. In this work, we address these limitations by proposing the FDA-Opt family of algorithms -- a unified generalization of both FDA and FedOpt. Our experimental evaluation focuses on fine-tuning LMs on downstream NLP tasks and demonstrates that FDA-Opt outperforms FedOpt even when it is configured with hyper-parameters specifically optimized for the latter. In other words, we show that FDA-Opt is a practical, drop-in replacement for FedOpt in modern FL libraries and systems: it requires no additional configuration and delivers superior performance out of the box.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。