Practical Federated Gradient Boosting Decision Trees

Abstract

Gradient Boosting Decision Trees (GBDTs) have become very successful in recent years, with many awards in machine learning and data mining competitions. There have been several recent studies on how to train GBDTs in the federated learning setting. In this paper, we focus on horizontal federated learning, where data samples with the same features are distributed among multiple parties. However, existing studies are not efficient or effective enough for practical use. They suffer either from the inefficiency due to the usage of costly data transformations such as secret sharing and homomorphic encryption, or from the low model accuracy due to differential privacy designs. In this paper, we study a practical federated environment with relaxed privacy constraints. In this environment, a dishonest party might obtain some information about the other parties' data, but it is still impossible for the dishonest party to derive the actual raw data of other parties. Specifically, each party boos

Stats

• citations145
• S2 citations—
• github stars0
• HF likes0
• heat score16.23
• arxiv keyli2019practical

Related papers

• Learning Federated Representations And Recommendations With Limited Negatives (2021)0.00
• Deep Boosting Learning: A Brand-new Cooperative Approach For Image-text Matching (2024)9.73
• Fedhap: Federated Hashing With Global Prototypes For Cross-silo Retrieval (2022)7.81
• CGPT: Cluster-guided Partial Tables With Llm-generated Supervision For Table Retrieval (2026)1.57
• A Study On FGSM Adversarial Training For Neural Retrieval (2023)7.81
• Efficient Learning Of Neighbor Representations For Boundary Trees And Forests (2018)0.00
• Lightfr: Lightweight Federated Recommendation With Privacy-preserving Matrix Factorization (2022)12.87
• Plug-and-play Parameter-efficient Tuning Of Embeddings For Federated Recommendation (2025)0.95