根据预期收益选择性升级,减少联邦学习通信开销
Expected Gain-based Escalation in Vertical Federated Learning
- 用预期收益评估是否升级,仅在有提升时才传输中间表示
- 在多视图分类任务中,通信量减少30%以上,准确率不降
- 无需额外训练路由模型,结果可解释性强,适合资源受限场景
协同推理可通过整合各参与方的互补信息提升预测性能,但在垂直联邦学习(VFL)中,对每个样本都进行融合会带来不必要的通信与计算开销。本文研究两轮式VFL推理中的选择性升级机制:第一轮以低成本生成客户端后验预测,第二轮仅在预计能提升最终决策时才触发嵌入融合。将路由决策建模为预期收益评分估计,当预测正确性提升足以抵消通信成本时即升级。该分析性评分结合校准后的聚合后验与类别级可靠性估计,均来自保留校准数据,实现可解释的路由器,无需单独训练路由网络。在多视图分类基准上的实验,包括受控的测试时视图退化设置,表明所提路由器在通信-准确率权衡上优于基于置信度、学习收益和拒答的基线方法。
原文摘要 · Abstract (English)
Collaborative inference can improve predictive performance by integrating complementary information across agents, but applying collaborative fusion to every sample can incur unnecessary communication and computational overhead. This trade-off is particularly relevant in vertical federated learning (VFL), where clients observe different views of the same sample and fusion typically requires transmitting intermediate representations to a server. We study selective escalation in a two-round VFL inference protocol, in which a low-cost first round produces a prediction from client posteriors and a second embedding-fusion round is invoked only when it is expected to improve the final decision. We formulate routing as expected-gain score estimation: a sample is escalated when a predicted improvement in correctness justifies the additional communication. The proposed analytical score combines a calibrated pooled posterior with classwise reliability estimates of the VFL model, both obtained from held-out calibration data, yielding an interpretable router that requires no separately trained routing network. Experiments on multi-view classification benchmarks, including controlled test--time view degradation settings, show that the proposed router improves the communication-accuracy trade-off over confidence-, learned-gain-, and deferral-based baselines.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。