pith. sign in

arxiv: 2211.06919 · v2 · pith:DPIHGU4Hnew · submitted 2022-11-13 · 💻 cs.LG · cs.AI· cs.CR

Towards Privacy-Aware Causal Structure Learning in Federated Setting

classification 💻 cs.LG cs.AIcs.CR
keywords learningfederateddatacausalstructuresettingalgorithmcentralize
0
0 comments X
read the original abstract

Causal structure learning has been extensively studied and widely used in machine learning and various applications. To achieve an ideal performance, existing causal structure learning algorithms often need to centralize a large amount of data from multiple data sources. However, in the privacy-preserving setting, it is impossible to centralize data from all sources and put them together as a single dataset. To preserve data privacy, federated learning as a new learning paradigm has attracted much attention in machine learning in recent years. In this paper, we study a privacy-aware causal structure learning problem in the federated setting and propose a novel Federated PC (FedPC) algorithm with two new strategies for preserving data privacy without centralizing data. Specifically, we first propose a novel layer-wise aggregation strategy for a seamless adaptation of the PC algorithm into the federated learning paradigm for federated skeleton learning, then we design an effective strategy for learning consistent separation sets for federated edge orientation. The extensive experiments validate that FedPC is effective for causal structure learning in a federated learning setting.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Preserving Data Privacy in Learning Causal Structure with Fully Homomorphic Encryption

    cs.CR 2026-06 unverdicted novelty 5.0

    FHE-based causal structure learning with circuit simplification, Newton-Raphson and Taylor approximations for division/log, and SIMD batching produces structures comparable to plaintext versions.