arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2607.01366cs.AI
收藏

Auto-FL-Research: 联邦学习算法的智能搜索

Auto-FL-Research: Agentic Search for Federated Learning Algorithms

NVIDIA, Santa Clara, USA(英伟达,美国圣克拉拉)

Holger R. Roth, Ziyue Xu, Chester Chen, Daguang Xu, Peter Cnudde, Andrew Feng

AI总结:

提出Auto-FL-Research (AFR),一种约束编码代理工作流,用于自动搜索联邦学习算法,在五个医疗和六个LEAF任务上验证了有效性,并分析了搜索结果的机制。

摘要:

联邦学习(FL)研究通常依赖于许多微小但重要的算法选择:优化器变体、服务器聚合规则、本地训练计划、归一化、正则化和模型架构。这些选择手动探索成本高昂,且在候选更改可能改变FL训练或评估路径时难以公平比较。在这项工作中,我们提出了Auto-FL-Research (AFR),一种用于FL算法配方搜索的约束编码代理工作流。代理可以提出并实现候选训练算法,包括服务器聚合规则、客户端更新计划、本地目标和注册模型变体,而任务配置文件固定了变异表面、计算预算、通信契约和最终模型评估。每个活动记录候选分数、运行时间、编辑文件、工件和失败状态。我们在五个医疗跨孤岛FLamby任务以及五个固定LEAF数据集加上LEAF合成任务的分组客户端配置文件上评估了AFR。五次种子重复评估支持在四个FLamby任务和六个LEAF配置文件中的五个上获得增益,同时也暴露了种子敏感和搜索选择的失败案例。相同预算的控制表明,一些增益对应于FL配方的变化,而其他改进则通过固定表面标量控制恢复,或在重复或保留评估中失败。这些混合结果本身就是贡献的一部分:它们展示了如何将代理生成的候选分为重复的FL机制、固定表面调优效应和选择的单次运行工件。

英文摘要:

Federated learning (FL) research often depends on many small but consequential algorithmic choices: optimizer variants, server aggregation rules, local training schedules, normalization, regularization, and model architecture. These choices are expensive to explore manually and difficult to compare fairly when candidate changes can also alter the FL training or evaluation path. In this work, we present Auto-FL-Research (AFR), a constrained coding-agent workflow for FL algorithmic recipe search. Agents may propose and implement candidate training algorithms, including server aggregation rules, client update schedules, local objectives, and registered model variants, while task profiles fix the mutation surface, compute budget, communication contract, and final model evaluation. Each campaign records candidate scores, runtime, edited files, artifacts, and failure status. We evaluate AFR on five healthcare cross-silo FLamby tasks and on grouped-client profiles for the five fixed LEAF datasets plus the LEAF synthetic task. Five-seed repeat evaluations support gains on four FLamby tasks and five of six LEAF profiles, while also exposing seed-sensitive and search-selected failure cases. Same-budget controls show that several gains correspond to FL-recipe changes, whereas other improvements are recovered by fixed-surface scalar controls or fail under repeat or held-out evaluation. These mixed outcomes are part of the contribution: they show how agent-generated candidates can be separated into repeated FL mechanisms, fixed-surface tuning effects, and selected single-run artifacts.

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

↑