解决分布式学习中特征不全问题,让随机森林在缺特征时仍能准确推理。
Mind the Missing Split: Resolving Feature Heterogeneity in Swarm Learning with Random Forests
- 提出动态推理策略,无需强制使用交集特征训练
- 在9个数据集上优于交集基准和本地模型
- 适合医疗等多机构协作且数据特征不一致的场景
Swarm Learning 是一种去中心化的协同学习机制,允许多个组织在无中央协调或直接数据共享的情况下共同训练模型。传统水平联邦学习假设各站点数据具有相同的特征集,但现实中因测量方式、协议及可用协变量差异,站点间仅部分特征重叠。这导致随机森林类算法在构建全局模型时面临挑战:当决策树遍历到本地缺失的特征分裂节点时,推理无法继续,通常需提前丢弃站点特有变量。本文针对特征空间部分重叠下的随机森林在联邦学习中的应用,提出多种确定性和概率性推理策略,可在不局限于特征交集的前提下解决缺失分裂问题。在9个数据集上的实验表明,所提方法在多种场景下均显著优于仅使用特征交集的基线方法及本地独立训练模型。
原文摘要 · Abstract (English)
Swarm Learning is a decentralized collaborative learning mechanism that allows multiple organizations to train a shared model without central coordination or direct data sharing. In typical horizontal Swarm Learning, datasets across sites are usually assumed to share the same feature set. However, in real-world applications, sites often have partially overlapping features because measurements, protocols, and available covariates differ across sites. This feature heterogeneity creates a practical issue for machine learning algorithms such as Random Forests. Specifically, when decision trees are pooled into a global Random Forest, inference at a given site can become ill-defined if a traversal encounters a split on a feature that is not available locally, often forcing organizations to discard site-specific variables upfront. In this paper, we address feature heterogeneity in Swarm Learning with Random Forests under partially overlapping feature spaces. We propose several deterministic and probabilistic inference-time strategies that resolve such missing splits without restricting training to the intersection of features. We evaluate the methods on nine datasets and demonstrate that they outperform both the intersection baseline and locally trained models across a broad range of scenarios.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。