arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2304.07537cs.LGcs.AIcs.DCcs.DS

具有可学习学习率的无梯度联邦梯度提升树

Gradient-less Federated Gradient Boosting Trees with Learnable Learning Rates

University of Cambridge(剑桥大学)

Chenyang Ma, Xinchi Qiu, Daniel J. Beutel, Nicholas D. Lane

AI总结:

针对水平联邦 XGBoost 中梯度共享导致的通信频繁和隐私问题,提出无梯度框架,通过使聚合树集成的学习率可学习来提升隐私与通信效率,通信轮次和开销降低 25 至 700 倍。

摘要:

去中心化数据集的隐私敏感性以及 eXtreme Gradient Boosting (XGBoost) 在表格数据上的鲁棒性,引发了在联邦学习 (FL) 背景下训练 XGBoost 的需求。现有关于水平联邦 XGBoost 的工作依赖于梯度共享,这导致了逐节点级别的通信频率和严重的隐私担忧。为了缓解这些问题,我们开发了一个创新的水平联邦 XGBoost 框架,该框架不依赖于梯度共享,并通过使聚合树集成的学习率变得可学习,同时提升了隐私性和通信效率。我们在各种分类和回归数据集上进行了广泛的评估,结果表明我们的方法实现了与最先进方法相当的性能,并通过将通信轮次和通信开销降低 25 倍至 700 倍,有效提高了通信效率。项目页面:https://flower.ai/blog/2023-04-19-xgboost-with-flower/

英文摘要:

The privacy-sensitive nature of decentralized datasets and the robustness of eXtreme Gradient Boosting (XGBoost) on tabular data raise the needs to train XGBoost in the context of federated learning (FL). Existing works on federated XGBoost in the horizontal setting rely on the sharing of gradients, which induce per-node level communication frequency and serious privacy concerns. To alleviate these problems, we develop an innovative framework for horizontal federated XGBoost which does not depend on the sharing of gradients and simultaneously boosts privacy and communication efficiency by making the learning rates of the aggregated tree ensembles learnable. We conduct extensive evaluations on various classification and regression datasets, showing our approach achieves performance comparable to the state-of-the-art method and effectively improves communication efficiency by lowering both communication rounds and communication overhead by factors ranging from 25x to 700x. Project Page: https://flower.ai/blog/2023-04-19-xgboost-with-flower/

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

↑