Skip to content
Conference Open access

FedFINFO: A General Full-Informativeness Federated Graph Learning from Open Cross-Domain Data

Sep 2026 · Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence · 0 citations · 32 references

TL;DR

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.

Abstract

Open cross-domain federated graph learning facilitates collaborative learning among clients from distinct graph domains while preserving privacy. However, severe structure and feature heterogeneity in open scenarios exacerbates the multiplicative amplification of structural and feature noises within graph neural network encoders, leading to significant negative transfer. Existing methods addressing partial heterogeneity are insufficient. We theoretically reveal this amplification mechanism and propose a novel learning method FedFINFO, which leverages full-informativeness shared knowledge. Specifically, we construct an aligned and general feature space integrating node semantic and structural roles. We proposed a counterfactual multi-view framework to explicitly learn a structure masker for extracting consensus subgraphs. These jointly suppress the mutual amplification of noises at the source. We also propose a history-aware adaptive multi-channel aggregation mechanism to enable dynamic and personalized sharing driven by channel similarity while preventing collaborative oscillation. FedFINFO effectively reconciles common knowledge sharing with personalized knowledge retention, significantly mitigating negative transfer. Extensive experiments under cross-dataset and cross-domain settings demonstrate the superiority of our method.

Read PDF

Similar papers

2025

FedIGL: Federated Invariant Graph Learning for Non-IID Graphs

This work proposes a FedIGL framework based on invariant learning, which effectively disrupts spurious correlations and further mines the invariant factors across different distributions, and proposes a novel Bi-Gradient Regularization strategy that introduces gradient constraints to guide the model in identifying clie...

Lingren Wang, Wenxuan Tu, Jiaxin Wang et al. · 2 citations
Book Open access Aug 2026

Disagreement-Aware Subgraph Federated Learning via Uncertainty-Guided Local-Global Alignment

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. · 0 citations
Preprint Aug 2026

FedCGR: Federated Cross-Domain Generative Recommendation

FedCGR is proposed, a federated generative CDR framework that keeps the item language stable and makes adaptation explicit and consistently outperforms federated generative baselines and achieves competitive performance against strong sequential and federated CDR methods under both full-ranking and sampled evaluation p...

Zhuo-Dong Liu, Hugen Lv, Xiang-Yu Li et al. · 0 citations
Open access Aug 2026

HGAT-Rec: a hierarchical graph attention framework for cross-domain e-commerce recommendation with heterogeneity-aware contrastive alignment

HGAT-Rec is proposed, which incorporates a heterogeneity-aware contrastive learning (HCL) objective that grounds view construction and sample selection in the typed relational structure of a cross-domain heterogeneous graph: type-stratified edge dropout preserves high-signal interaction channels proportionally to their...

Rui Zhang, YaTing Zhao, FengBo Wang et al. · 0 citations
Jul 2026

FedOGL: Combating Catastrophic Forgetting in Federated Open-World Multimodal Graph Learning

FedOGL preserves historical decision behavior through replay and task-start distillation, while protecting graph-propagation memory via projection onto a globally shared structure basis via projection onto a globally shared structure basis.

Ze-Kai Chen, Haodong Lu, Shi-Hao Li 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.