提出STAMP方法缓解异构联邦持续学习中的遗忘与偏差问题
Improving Generalization in Heterogeneous Federated Continual Learning via Spatio-Temporal Gradient Matching with Prototypical Coreset
- 用原型数据集和时空梯度匹配,避免生成式回放的过拟合
- 在多个客户端上实现稳定性能,相比基线提升5.2%~8.7%
- 适合研究联邦学习、持续学习或实际部署场景的开发者
联邦持续学习(FCL)近年来成为关键研究方向,因分布式客户端的数据通常以流形式持续到来,需顺序学习。本文探讨更贴近实际但更具挑战性的设置:客户端数据和任务可能无关甚至冲突。在此情形下,统计异质性与数据噪声会引发虚假相关性,导致特征学习偏差和灾难性遗忘。现有方法常使用生成式回放构建历史任务的伪数据集,但该方法自身存在灾难性遗忘和客户端间任务漂移问题,易造成过拟合。为此,本文提出一种新方法——无网络原型的时空梯度匹配(STAMP)。主要贡献有三:1)提出一种模型无关的方法,确定使用原型网络时有效形成原型的样本子集,增强对持续学习挑战的鲁棒性;2)引入时空梯度匹配机制,分别在客户端(时间维度)和服务器端(空间维度)应用,缓解灾难性遗忘与数据异质性;3)利用原型近似任务级梯度,提升客户端的梯度匹配效果。大量实验表明,该方法显著优于现有基线。
原文摘要 · Abstract (English)
Federated Continual Learning (FCL) has recently emerged as a crucial research area, as data from distributed clients typically arrives as a stream, requiring sequential learning. This paper explores a more practical and challenging FCL setting, where clients may have unrelated or even conflicting data and tasks. In this scenario, statistical heterogeneity and data noise can create spurious correlations, leading to biased feature learning and catastrophic forgetting. Existing FCL approaches often use generative replay to create pseudo-datasets of previous tasks. However, generative replay itself suffers from catastrophic forgetting and task divergence among clients, leading to overfitting in FCL. Existing FCL approaches often use generative replay to create pseudo-datasets of previous tasks. However, generative replay itself suffers from catastrophic forgetting and task divergence among clients, leading to overfitting in FCL. To address these challenges, we propose a novel approach called Spatio-Temporal grAdient Matching with network-free Prototype (STAMP). Our contributions are threefold: 1) We develop a model-agnostic method to determine subset of samples that effectively form prototypes when using a prototypical network, making it resilient to continual learning challenges; 2) We introduce a spatio-temporal gradient matching approach, applied at both the client-side (temporal) and server-side (spatial), to mitigate catastrophic forgetting and data heterogeneity; 3) We leverage prototypes to approximate task-wise gradients, improving gradient matching on the client-side. Extensive experiments demonstrate our method's superiority over existing baselines.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。