Federated multimodal graph learning with Topology-aware Cross-modal Routing (FedTCR) is proposed, the first systematic algorithm designed for FMGL and outperforms state-of-the-art baselines on both graph-centric and modality-centric tasks.
Abstract
Multimodal-attributed graphs (MAGs), where nodes carry heterogeneous semantic content across multiple modalities while edges encode relational dependencies, have been widely adopted across diverse domains. Federated multimodal graph learning (FMGL) extends federated graph learning (FGL) to MAGs, enabling collaborative optimization across decentralized MAGs without exposing raw data. However, naively applying existing FGL methods to FMGL is insufficient, as they fail to navigate the multifaceted heterogeneity inherent in decentralized MAGs, including task heterogeneity across diverse client objectives, modality heterogeneity from discrepant modality quality and semantic domains, and topology heterogeneity arising from divergent topological patterns with low cross-modality correlation. To address these challenges, we propose Federated multimodal graph learning with Topology-aware Cross-modal Routing (FedTCR), the first systematic algorithm designed for FMGL. To handle task heterogeneity, FedTCR employs a two-stage paradigm that comprises federated task-agnostic pre-training followed by isolated task-oriented fine-tuning. To jointly address modality and topology heterogeneity, FedTCR introduces a topology-aware cross-modal routing mechanism. Concretely, each client distills modality-specific knowledge into compact prototypes via topology-aware importance-weighted aggregation informed by graph structure; the server then evaluates cross-client cross-modal relationships among these structure-informed prototypes and routes informative ones as contrastive references, driving a tri-level cross-modal contrastive learning scheme that jointly aligns cross-client modalities while preserving discrimination. Experiments across 7 domains demonstrate that FedTCR outperforms state-of-the-art baselines on both graph-centric and modality-centric tasks.
FedDUA is proposed, a novel disagreement-aware and uncertainty-guided framework for subgraph FL that first models cross-client semantic disagreement via a lightweight semantic anchor graph and derives adaptive aggregation weights for reliable global federated knowledge.
Keao Xi, Nan-Nan Wu, Yi-Ming Zhao et al.· Proceedings of the 32nd ACM...· 0 citations
FedRAHi, a Reliability-Aware Hierarchical collaboration framework for FedGFM that leverages the symbiotic knowledge to construct a client-aware affinity graph, and performs personalized weighting of client parameters based on the reliability scores is proposed.
Xiangkai Zhu, Yeyu Yan, Peng-Peng Qiao et al.· Proceedings of the 32nd ACM...· 0 citations
In personalized federated learning, the coexistence of model heterogeneity and non-independent and identically distributed (non-IID) data makes cross-client collaboration challenging. Client models may have inconsistent architectures and distinct local knowledge distributions, while conventional parameter aggregation o...
Jia-Qi Yan, Xuan Yang, De-Sheng Wang et al.· Journal of King Saud Univers...· 0 citations
This work proposes a counterfactual multi-view framework to explicitly learn a structure masker for extracting consensus subgraphs and proposes a history-aware adaptive multi-channel aggregation mechanism to enable dynamic and personalized sharing driven by channel similarity while preventing collaborative oscillation.
Wan Zhang, Xiao-Qian Jiang, Ye Wang et al.· Proceedings of the Thirty-Fi...· 0 citations
The proliferation of interconnected devices in the Internet of Things (IoT) has driven the adoption of federated graph learning (FGL) to extract relational intelligence without compromising edge privacy. However, deploying FGL in real-world IoT environments faces a critical bottleneck: the extreme statistical and struc...
Xuan Li, Jun-Zhe Wang, Yi-Fan Fu et al.· IEEE Internet of Things Jour...· 0 citations
FedTAR is proposed, a task-aware federated fine-tuning method for MoE-based LLMs that establishes the association between local updates and task preference via routing outputs and preserves expert specialization and mitigates destructive interference among heterogeneous clients.
Ting-Qi Wang, Hongyu Ke, Hao-Xin Wang et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.