SDFed: Bridging Local Global Discrepancy via Subspace Refinement and Divergence Control in Federated Prompt Learning
Yicheng Di, Wei Yuan, Tieke He, Yuan Liu, Hongzhi Yin

TL;DR
SDFed is a federated prompt learning framework that enhances adaptation to client heterogeneity by allowing variable prompt lengths and employing subspace refinement and divergence control strategies.
Contribution
It introduces a novel heterogeneous federated prompt learning method that supports variable prompt lengths and mitigates local-global conflicts for better performance.
Findings
SDFed improves performance in heterogeneous federated settings.
It maintains robustness across multiple datasets.
The method effectively balances local and global knowledge transfer.
Abstract
Vision-language pretrained models offer strong transferable representations, yet adapting them in privacy-sensitive multi-party settings is challenging due to the high communication cost of federated optimization and the limited local data on clients. Federated prompt learning mitigates this issue by keeping the VLPM backbone frozen and collaboratively training lightweight prompt parameters. However, existing approaches typically enforce a unified prompt structure and length across clients, which is inadequate under practical client heterogeneity in both data distributions and system resources, and may further introduce conflicts between globally shared and locally optimal knowledge. To address these challenges, we propose \textbf{SDFed}, a heterogeneous federated prompt learning framework that bridges Local-Global Discrepancy via Subspace Refinement and Divergence Control. SDFed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
