arXiv:2412.15492cs.GTcs.LG2024-12中稿 · AAAI被引 3

用双层博弈提升联邦学习中客户端与服务器的协作效率。

DualGFL: Federated Learning with a Dual-Level Coalition-Auction Game

  • 下层联盟博弈让客户端按偏好组队,上层拍卖博弈决定训练资格。
  • 实验显示双层机制同时提升服务器和客户端收益,最高增益达18.7%。
  • 适合研究分布式优化与激励机制的科研人员参考。

尽管已有基于博弈论的联邦学习研究取得一定成果,但多数方法仅采用单层博弈(合作或竞争),难以反映实际参与方的复杂互动。为此,我们提出DualGFL,一种在合作-竞争环境中具有双层博弈结构的新型联邦学习框架。下层为非合作型联盟博弈,客户端根据偏好形成联盟;上层为多属性拍卖博弈,联盟竞标训练参与权。下层引入新的拍卖感知效用函数,并提出帕累托最优划分算法,依据客户端偏好找到最优分组。上层在资源约束下构建多属性拍卖模型,推导出最大化联盟中标概率与利润的均衡出价策略。同时设计贪心算法以最大化中心服务器的总效用。在真实数据集上的大量实验表明,DualGFL能有效提升服务器与客户端双方的效用,相较基线方法最高提升18.7%。

原文摘要 · Abstract (English)

Despite some promising results in federated learning using game-theoretical methods, most existing studies mainly employ a one-level game in either a cooperative or competitive environment, failing to capture the complex dynamics among participants in practice. To address this issue, we propose DualGFL, a novel Federated Learning framework with a Dual-level Game in cooperative-competitive environments. DualGFL includes a lower-level hedonic game where clients form coalitions and an upper-level multi-attribute auction game where coalitions bid for training participation. At the lower-level DualGFL, we introduce a new auction-aware utility function and propose a Pareto-optimal partitioning algorithm to find a Pareto-optimal partition based on clients' preference profiles. At the upper-level DualGFL, we formulate a multi-attribute auction game with resource constraints and derive equilibrium bids to maximize coalitions' winning probabilities and profits. A greedy algorithm is proposed to maximize the utility of the central server. Extensive experiments on real-world datasets demonstrate DualGFL's effectiveness in improving both server utility and client utility.

联邦学习博弈论激励机制

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。