SCAFFLSA: 降低联邦线性随机逼近和TD学习中的异质性
SCAFFLSA: Taming Heterogeneity in Federated Linear Stochastic Approximation and TD Learning
AI总结:
SCAFFLSA通过控制变体纠正客户端漂移,实现联邦线性随机逼近和TD学习中异质性的有效处理,具有线性加速的样本复杂度。
摘要:
在本文中,我们分析了联邦线性随机逼近(FedLSA)算法的样本和通信复杂度。我们明确量化了局部训练中代理异质性的影响。我们显示FedLSA的通信复杂度与所需精度$ε$的倒数成多项式关系。为克服这一问题,我们提出SCAFFLSA,这是FedLSA的新变种,利用控制变体来纠正客户端漂移,并建立了其样本和通信复杂度。我们显示,对于统计上异质的代理,其通信复杂度与所需精度成对数关系,类似于Scaffnew。一个重要发现是,与Scaffnew现有结果相比,样本复杂度与代理数量的倒数成比例,这一性质称为线性加速。实现这种线性加速需要完全新的理论论证。我们应用所提出的方法到具有线性函数逼近的联邦时差学习,并分析相应的复杂度改进。
英文摘要:
In this paper, we analyze the sample and communication complexity of the federated linear stochastic approximation (FedLSA) algorithm. We explicitly quantify the effects of local training with agent heterogeneity. We show that the communication complexity of FedLSA scales polynomially with the inverse of the desired accuracy $ε$. To overcome this, we propose SCAFFLSA a new variant of FedLSA that uses control variates to correct for client drift, and establish its sample and communication complexities. We show that for statistically heterogeneous agents, its communication complexity scales logarithmically with the desired accuracy, similar to Scaffnew. An important finding is that, compared to the existing results for Scaffnew, the sample complexity scales with the inverse of the number of agents, a property referred to as linear speed-up. Achieving this linear speed-up requires completely new theoretical arguments. We apply the proposed method to federated temporal difference learning with linear function approximation and analyze the corresponding complexity improvements.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。