Gradient-less Federated Gradient Boosting Trees with Learnable Learning Rates

Chenyang Ma, Xinchi Qiu, Daniel J. Beutel, Nicholas D. Lane
4/15/2023
cs.LGcs.AIcs.DC

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

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/

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

SecureCut: Federated Gradient Boosting Decision Trees with Efficient Machine Unlearning

84% match2023

Gradient Projection onto Historical Descent Directions for Communication-Efficient Federated Learning

83% match2025

Privacy Preserving and Robust Aggregation for Cross-Silo Federated Learning in Non-IID Settings

82% match2025

Privacy-preserving gradient-based fair federated learning

82% match2024

FLUE: Federated Learning with Un-Encrypted model weights

82% match2024

Data-Free Black-Box Federated Learning via Zeroth-Order Gradient Estimation

82% match2025

Cite this paper

@article{ma2023gradientless,
  title  = {Gradient-less Federated Gradient Boosting Trees with Learnable Learning Rates},
  author = {Chenyang Ma and Xinchi Qiu and Daniel J. Beutel and Nicholas D. Lane},
  year   = {2023},
  eprint = {2304.07537},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.07537v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2304.07537.svg)](https://codeofpaper.com/paper/2304.07537)

Discussion