arXivDaily arXiv每日学术速递 周一至周五更新
​通知:联邦节假日调休:哥伦布日 / 原住民日(Columbus Day / Indigenous Peoples' Day),今日(13日)无更新。
arXiv 2409.01128cs.LGcs.CV

扩散驱动的数据重放:一种对抗联邦类增量学习中遗忘的新方法

Diffusion-Driven Data Replay: A Novel Approach to Combat Forgetting in Federated Class Continual Learning

China University of Petroleum(中国石油大学);WeBank(微众银行);Pazhou Laboratory(琶洲实验室);South China University of Technology(华南理工大学);The Hong Kong University of Science and Technology(香港科技大学)

Jinglin Liang, Jin Zhong, Hanlin Gu, Zhongqi Lu, Xingxing Tang, Gang Dai, Shuangping Huang, Lixin Fan, Qiang Yang

AI总结:

针对联邦类增量学习中的灾难性遗忘问题,本文提出利用预训练条件扩散模型进行逆向数据重放,并结合对比学习提升生成数据质量,显著超越现有基线。

摘要:

联邦类增量学习(FCCL)融合了分布式客户端学习的挑战与无缝适应新类别而不遗忘旧类别的需求。FCCL 中的关键挑战是灾难性遗忘,这一问题在持续学习(CL)中已得到一定程度的探索。然而,由于隐私保护要求,一些传统方法(如经验重放)不能直接应用于 FCCL。现有的 FCCL 方法通过联邦训练 GAN 或无数据知识蒸馏来生成历史数据以缓解遗忘。但这些方法通常面临生成器训练不稳定或生成数据质量低的问题,限制了它们对模型的指导作用。为应对这一挑战,我们提出了一种基于扩散模型的新型数据重放方法。我们不训练扩散模型,而是采用一个预训练的条件扩散模型对每个类别进行逆向工程,在模型的输入空间中搜索每个类别对应的输入条件,从而在保证有效生成的同时显著减少计算资源和时间消耗。此外,我们通过对比学习增强分类器在生成数据和真实数据上的域泛化能力,间接提升生成数据对真实数据的表征能力。综合实验表明,我们的方法显著优于现有基线。代码可在 https://github.com/jinglin-liang/DDDR 获取。

英文摘要:

Federated Class Continual Learning (FCCL) merges the challenges of distributed client learning with the need for seamless adaptation to new classes without forgetting old ones. The key challenge in FCCL is catastrophic forgetting, an issue that has been explored to some extent in Continual Learning (CL). However, due to privacy preservation requirements, some conventional methods, such as experience replay, are not directly applicable to FCCL. Existing FCCL methods mitigate forgetting by generating historical data through federated training of GANs or data-free knowledge distillation. However, these approaches often suffer from unstable training of generators or low-quality generated data, limiting their guidance for the model. To address this challenge, we propose a novel method of data replay based on diffusion models. Instead of training a diffusion model, we employ a pre-trained conditional diffusion model to reverse-engineer each class, searching the corresponding input conditions for each class within the model's input space, significantly reducing computational resources and time consumption while ensuring effective generation. Furthermore, we enhance the classifier's domain generalization ability on generated and real data through contrastive learning, indirectly improving the representational capability of generated data for real data. Comprehensive experiments demonstrate that our method significantly outperforms existing baselines. Code is available at https://github.com/jinglin-liang/DDDR.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑