arXiv:2504.02285cs.LGcs.AI2025-04中稿 · ACM Computing Surv…综述被引 13

树模型在垂直联邦学习中如何高效协作的系统综述

Tree-based Models for Vertical Federated Learning: A Survey

  • 按特征聚合与标签分发分为两类树模型
  • 对比分析通信效率与隐私保护机制差异
  • 适合关注联邦学习落地的工业界研究者

树模型因高效、鲁棒且可解释性强,在众多实际应用中表现优异,近年来被引入垂直联邦学习(VFL)场景。本文从通信与计算协议角度,系统梳理树模型在VFL中的应用,将其分为特征汇聚型与标签分发型两类,并深入讨论其特性、优势、隐私保护机制及应用场景。同时,总结了满足学术与工业需求的设计原则。通过一系列实验,验证不同树模型在性能与效率上的差异与进步。

原文摘要 · Abstract (English)

Tree-based models have achieved great success in a wide range of real-world applications due to their effectiveness, robustness, and interpretability, which inspired people to apply them in vertical federated learning (VFL) scenarios in recent years. In this paper, we conduct a comprehensive study to give an overall picture of applying tree-based models in VFL, from the perspective of their communication and computation protocols. We categorize tree-based models in VFL into two types, i.e., feature-gathering models and label-scattering models, and provide a detailed discussion regarding their characteristics, advantages, privacy protection mechanisms, and applications. This study also focuses on the implementation of tree-based models in VFL, summarizing several design principles for better satisfying various requirements from both academic research and industrial deployment. We conduct a series of experiments to provide empirical observations on the differences and advances of different types of tree-based models.

联邦学习树模型隐私计算

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。