arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.12014cs.LG
收藏

FedGRPO: 通过领域客户端的群体相对奖励私有优化基础模型

FedGRPO: Privately Optimizing Foundation Models with Group-Relative Rewards from Domain Client

Gongxi Zhu, Hanlin Gu, Lixin Fan, Qiang Yang, Yuxing Han

AI总结:

FedGRPO通过群体相对奖励机制,在保护隐私的前提下提升基础模型的性能和通信效率。

摘要:

联邦基础模型(FedFMs)的一个重要方向是利用小客户端模型的数据来提升大型服务器端基础模型的性能。现有基于模型级别或表示级别知识转移的方法要么需要昂贵的本地训练,要么导致高通信成本,并引入不可避免的隐私风险。我们把这个问题重新表述为一种强化学习风格的评估过程,并提出FedGRPO,一个保护隐私的框架,包含两个模块。第一个模块通过构建辅助数据的轻量级置信图进行基于能力的专家选择,以识别每个问题最合适的客户端。第二个模块利用来自群体相对策略优化(GRPO)框架的

英文摘要:

One important direction of Federated Foundation Models (FedFMs) is leveraging data from small client models to enhance the performance of a large server-side foundation model. Existing methods based on model level or representation level knowledge transfer either require expensive local training or incur high communication costs and introduce unavoidable privacy risks. We reformulate this problem as a reinforcement learning style evaluation process and propose FedGRPO, a privacy preserving framework comprising two modules. The first module performs competence-based expert selection by building a lightweight confidence graph from auxiliary data to identify the most suitable clients for each question. The second module leverages the "Group Relative" concept from the Group Relative Policy Optimization (GRPO) framework by packaging each question together with its solution rationale into candidate policies, dispatching these policies to a selected subset of expert clients, and aggregating solely the resulting scalar reward signals via a federated group-relative loss function. By exchanging reward values instead of data or model updates, FedGRPO reduces privacy risk and communication overhead while enabling parallel evaluation across heterogeneous devices. Empirical results on diverse domain tasks demonstrate that FedGRPO achieves superior downstream accuracy and communication efficiency compared to conventional FedFMs baselines.

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

↑