Skip to content
Book Open access

Federated Nonlinear Causal Discovery via Divide-and-Conquer Learning

Aug 2026 · Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2 · pp. 1462-1473 · 0 citations · 21 references

TL;DR

DC-FNCD (Divide-and-Conquer based Federated Nonlinear Causal Discovery) is proposed, which decomposes the global problem into independent per-variable neighborhood learning tasks, enabling lossless federated aggregation without raw data exchange.

Abstract

Federated causal discovery aims to learn causal structures from distributed data without sharing raw samples. Existing federated nonlinear methods adopt a monolithic global strategy that optimizes the entire graph simultaneously, suffering from catastrophic error propagation: a single misidentified edge cascades through the global structure, severely degrading accuracy under heterogeneous and limited local data. We propose DC-FNCD (Divide-and-Conquer based Federated Nonlinear Causal Discovery), which decomposes the global problem into independent per-variable neighborhood learning tasks. The core mechanism is a characteristic function-based conditional independence test whose empirical statistics admit exact linear decomposition across clients, enabling lossless federated aggregation without raw data exchange. Local neighborhoods are merged via conflict-aware skeleton construction and oriented through federated additive noise model testing. Extensive experiments demonstrate that DC-FNCD significantly outperforms state-of-the-art federated baselines. The source code is available at https://github.com/Xianjie-Guo/DC-FNCD.

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

FedHiPL: Federated Hierarchical Prototype Learning for Heterogeneous Non-IID Data

Federated learning (FL) collaboratively trains models across networked industrial Internet of Things (IIoT) terminals. However, statistical heterogeneity in IIoT data often hinders the performance of global models. Current FL methods typically focus on single-level representation alignment and fail to exploit gradient-...

Fangyu Li, Zhi-Cheng Chen, Jinghao Liu et al. · 0 citations
Conference Open access Sep 2026

FedUP: Uncertainty-Aware Personalized Federated Learning via Probabilistic Prototypes

FedUP is an uncertainty-aware personalized federated learning framework that models prototypes as probability distributions and aggregates prototype distributions through reliability-informed barycenters on the statistical manifold, suppressing unreliable contributions while preserving geometric structure.

Fu Qi, Weishan Zhang, Ling-Zhao Meng et al. · 0 citations
Jul 2026

FedTopo: Relation-Level Topology Sharing for Model-Heterogeneous Federated Learning

FedTopo is proposed, a relation-level framework that encodes global knowledge as class relation topology, capturing how classes relate within each client rather than where they lie in feature space.

Zhaoyang Ma, Zhihao Wu, Xin Gao et al. · 0 citations
2025

Rising from Ashes: Generalized Federated Learning via Dynamic Parameter Reset

A novel FL framework is presented, FedPhoenix, that stochastically re-sets partial parameters in each round to destroy some features of the global model, guiding FL training to learn multiple generalized features for inference rather than specific overfitting features.

Jia-Hao Wu, Ming Hu, Yanxin Yang et al. · 1 citation
Conference Open access Sep 2026

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

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

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.