Federated XGBoost on Sample-Wise Non-IID Data
Not on the map. Why?
Abstract (arXiv)
Federated Learning (FL) is a paradigm for jointly training machine learning algorithms in a decentralized manner which allows for parties to communicate with an aggregator to create and train a model, without exposing the underlying raw data distribution of the local parties involved in the training process. Most research in FL has been focused on Neural Network-based approaches, however Tree-Based methods, such as XGBoost, have been underexplored in Federated Learning due to the challenges in overcoming the iterative and additive characteristics of the algorithm. Decision tree-based models, in particular XGBoost, can handle non-IID data, which is significant for algorithms used in Federated Learning frameworks since the underlying characteristics of the data are decentralized and have risks of being non-IID by nature. In this paper, we focus on investigating the effects of how Federated XGBoost is impacted by non-IID distributions by performing experiments on various sample size-based data skew scenarios and how these models perform under various non-IID scenarios. We conduct a set of extensive experiments across multiple different datasets and different data skew partitions. Our experimental results demonstrate that despite the various partition ratios, the performance of the models stayed consistent and performed close to or equally well against models that were trained in a centralized manner.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 16 of its 37 references that are in the map. First posted on arXiv 3 Sep 2022.
Builds on
16 of 37 references.
References · 16
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
- 2018Federated Learning with Non-IID Datacited by 1,099
- 2019Robust and Communication-Efficient Federated Learning from Non-IID Datacited by 415
- 2018A Hybrid Approach to Privacy-Preserving Federated Learningcited by 208
- 2019SecureBoost: A Lossless Federated Learning Frameworkcited by 174
- 2020IBM Federated Learning: an Enterprise Framework White Paper V0.1cited by 57
- 2019Practical Federated Gradient Boosting Decision Treescited by 53
- 2019Federated Forestcited by 49
- 2020FederBoost: Private Federated Learning for GBDTcited by 27
- 2019SecureGBM: Secure Multi-Party Gradient Boostingcited by 19
- 2019The Tradeoff Between Privacy and Accuracy in Anomaly Detection Using Federated XGBoostcited by 13
4 more
- 2019BitcoinHeist: Topological Data Analysis for Ransomware Detection on the Bitcoin Blockchaincited by 12
- 2019Boosting Privately: Privacy-Preserving Federated Extreme Boosting for Mobile Crowdsensingcited by 11
- 2020Adaptive Histogram-Based Gradient Boosted Trees for Federated Learningcited by 10
- 2019DDSketch: A fast and fully-mergeable quantile sketch with relative-error guaranteescited by 7
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 0; 2026: 1.
4 papers.
- 2023Gradient-less Federated Gradient Boosting Trees with Learnable Learning Ratescited by 12
- 2024Non-IID data in Federated Learning: A Survey with Taxonomy, Metrics, Methods, Frameworks and Future Directionscited by 12
- 2024Histogram-Based Federated XGBoost using Minimal Variance Sampling for Federated Tabular Datacited by 1
- 2026FedSCS-XGB -- Federated Server-centric surrogate XGBoost for continual health monitoringcited by 0
- 2026FedSCS-XGB -- Federated Server-centric surrogate XGBoost for continual health monitoring6 Mar 2026
- 2024Non-IID data in Federated Learning: A Survey with Taxonomy, Metrics, Methods, Frameworks and Future Directions19 Nov 2024
- 2024Histogram-Based Federated XGBoost using Minimal Variance Sampling for Federated Tabular Data3 May 2024
- 2023Gradient-less Federated Gradient Boosting Trees with Learnable Learning Rates15 Apr 2023