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

FUPareto:通过帕累托增强优化弥合联邦去学习中的遗忘-效用差距

FUPareto: Bridging the Forgetting-Utility Gap in Federated Unlearning via Pareto Augmented Optimization

Zeyan Wang, Zhengmao Liu, Yongxin Cai, Chi Li, Xiaoying Tang, Jingchao Chen, Zibin Pan, Jing Qiu

AI总结:

FUPareto通过帕累托增强优化方法,有效解决联邦去学习中遗忘与效用的矛盾,提升去学习效率并降低成员推断攻击风险。

摘要:

联邦去学习(FU)旨在高效地从联邦模型中移除特定客户端数据的影响,同时保持对剩余客户端的效用。然而,仍存在三个关键挑战:(1)现有的去学习目标往往会损害模型效用或增加成员推断攻击(MIA)的脆弱性;(2)遗忘与效用之间存在持续的冲突,进一步去学习不可避免地会损害保留的性能;(3)对多客户端同时去学习的支持较差,因为客户端间的梯度冲突会降低遗忘的质量。为了解决这些问题,我们提出了FUPareto,一种通过帕累托增强优化的高效去学习框架。我们首先引入了最小边界位移(MBS)损失,该损失通过抑制目标类logit低于最高非目标类logit来强制去学习;这可以提高去学习效率并缓解MIA风险。在去学习过程中,FUPareto通过帕累托改进步骤来保持模型效用,并执行帕累托扩展以确保遗忘。具体而言,在帕累托扩展过程中,该框架集成了一个空空间投影多重梯度下降算法(MGDA)以解耦梯度冲突。这使得在最小化效用退化的同时,能够为多个客户端实现有效、公平且同时的去学习。在多样化的场景中进行的广泛实验表明,FUPareto在去学习效果和保留效用方面始终优于最先进的FU方法。

英文摘要:

Federated Unlearning (FU) aims to efficiently remove the influence of specific client data from a federated model while preserving utility for the remaining clients. However, three key challenges remain: (1) existing unlearning objectives often compromise model utility or increase vulnerability to Membership Inference Attacks (MIA); (2) there is a persistent conflict between forgetting and utility, where further unlearning inevitably harms retained performance; and (3) support for concurrent multi-client unlearning is poor, as gradient conflicts among clients degrade the quality of forgetting. To address these issues, we propose FUPareto, an efficient unlearning framework via Pareto-augmented optimization. We first introduce the Minimum Boundary Shift (MBS) Loss, which enforces unlearning by suppressing the target class logit below the highest non-target class logit; this can improve the unlearning efficiency and mitigate MIA risks. During the unlearning process, FUPareto performs Pareto improvement steps to preserve model utility and executes Pareto expansion to guarantee forgetting. Specifically, during Pareto expansion, the framework integrates a Null-Space Projected Multiple Gradient Descent Algorithm (MGDA) to decouple gradient conflicts. This enables effective, fair, and concurrent unlearning for multiple clients while minimizing utility degradation. Extensive experiments across diverse scenarios demonstrate that FUPareto consistently outperforms state-of-the-art FU methods in both unlearning efficacy and retained utility.

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

↑