A Federated Learning Benchmark on Tabular Data: Comparing Tree-Based Models and Neural Networks
William Lindskog, Christian Prehofer
TL;DR
This work addresses the challenge of applying federated learning to tabular data by benchmarking three federated tree-based models and three DNNs across 10 public datasets under varied non-IID partitions. It uses horizontal FL with label, feature, and quantity skew to compare performance, highlighting that federated boosted trees, notably Federated XGBoost, consistently outperform federated neural networks. The study also shows that tree-based federated methods maintain advantages as the number of participating clients grows, and TBMs typically outperform parametric models. The findings suggest TBMs offer robust, scalable, and privacy-preserving benefits for tabular data in FL deployments, guiding model selection and future research on partition-robust and efficient FL strategies.
Abstract
Federated Learning (FL) has lately gained traction as it addresses how machine learning models train on distributed datasets. FL was designed for parametric models, namely Deep Neural Networks (DNNs).Thus, it has shown promise on image and text tasks. However, FL for tabular data has received little attention. Tree-Based Models (TBMs) have been considered to perform better on tabular data and they are starting to see FL integrations. In this study, we benchmark federated TBMs and DNNs for horizontal FL, with varying data partitions, on 10 well-known tabular datasets. Our novel benchmark results indicates that current federated boosted TBMs perform better than federated DNNs in different data partitions. Furthermore, a federated XGBoost outperforms all other models. Lastly, we find that federated TBMs perform better than federated parametric models, even when increasing the number of clients significantly.
