解决联邦学习中未知干预导致的因果发现难题
Regret-Based Federated Causal Discovery with Unknown Interventions
- 通过联合客户端图结构先恢复全局CPDAG
- 利用干预带来的结构差异定向新增边,缩小等价类
- 适合医疗等存在异质干预的隐私敏感场景
大多数因果发现方法从观测数据中恢复一个表示马尔可夫等价类的完全部分有向无环图(CPDAG)。近期工作将这些方法扩展到联邦设置以应对数据分散和隐私约束,但通常假设所有客户端共享相同因果模型。这一假设在实践中不切实际,例如不同医院间的政策或协议会自然导致异质且未知的干预。本文针对未知客户端级干预下的联邦因果发现问题,提出I-PERI算法:首先恢复客户端图的并集的CPDAG,再利用跨客户端干预引发的结构差异来定向额外边,从而得到更紧致的等价类,称为Φ-马尔可夫等价类,用Φ-CPDAG表示。我们提供了I-PERI的收敛性与隐私保护性质的理论保证,并在合成数据上进行了实证评估,验证了该算法的有效性。
原文摘要 · Abstract (English)
Most causal discovery methods recover a completed partially directed acyclic graph representing a Markov equivalence class from observational data. Recent work has extended these methods to federated settings to address data decentralization and privacy constraints, but often under idealized assumptions that all clients share the same causal model. Such assumptions are unrealistic in practice, as client-specific policies or protocols, for example, across hospitals, naturally induce heterogeneous and unknown interventions. In this work, we address federated causal discovery under unknown client-level interventions. We propose I-PERI, a novel federated algorithm that first recovers the CPDAG of the union of client graphs and then orients additional edges by exploiting structural differences induced by interventions across clients. This yields a tighter equivalence class, which we call the $\mathbfΦ$-Markov Equivalence Class, represented by the $\mathbfΦ$-CPDAG. We provide theoretical guarantees on the convergence of I-PERI, as well as on its privacy-preserving properties, and present empirical evaluations on synthetic data demonstrating the effectiveness of the proposed algorithm.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。