» Articles » PMID: 39851686

: Communication-Efficient Vertical Federated Learning Via Dynamic Caching and Feature Selection

Overview
Journal Entropy (Basel)
Publisher MDPI
Date 2025 Jan 24
PMID 39851686
Authors
Affiliations
Soon will be listed here.
Abstract

Vertical Federated Learning (VFL) is a promising category of Federated Learning that enables collaborative model training among distributed parties with data privacy protection. Due to its unique training architecture, a key challenge of VFL is high communication cost due to transmitting intermediate results between the Active Party and Passive Parties. Current communication-efficient VFL methods rely on using stale results without meticulous selection, which can impair model accuracy, particularly in noisy data environments. To address these limitations, this work proposes , a new VFL training method that leverages dynamic caching and feature selection to boost communication efficiency and model accuracy. In each communication round, the employed caching scheme allows multiple batches of intermediate results to be cached and strategically reused by different parties, reducing the communication overhead while maintaining model accuracy. Additionally, to eliminate the negative impact of noisy features that may undermine the effectiveness of using stale results to reduce communication rounds and incur significant model degradation, a feature selection strategy is integrated into each round of local updates. Theoretical analysis is then conducted to provide guidance on cache configuration, optimizing performance. Finally, extensive experimental results validate 's efficacy, demonstrating remarkable improvements in communication efficiency and model accuracy.

References
1.
Wen J, Zhang Z, Lan Y, Cui Z, Cai J, Zhang W . A survey on federated learning: challenges and applications. Int J Mach Learn Cybern. 2022; 14(2):513-535. PMC: 9650178. DOI: 10.1007/s13042-022-01647-y. View

2.
Castiglia T, Wang S, Patterson S . Flexible Vertical Federated Learning With Heterogeneous Parties. IEEE Trans Neural Netw Learn Syst. 2023; 35(12):17878-17892. DOI: 10.1109/TNNLS.2023.3309701. View