arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.03028cs.LGcs.AI

Collaborative Causal Discovery with Atomic Interventions

University of Massachusetts Amherst(马萨诸塞大学阿默斯特分校);Amazon(亚马逊)

Raghavendra Addanki, Shiva Prasad Kasiviswanathan

英文摘要:

We introduce a new Collaborative Causal Discovery problem, through which we model a common scenario in which we have multiple independent entities each with their own causal graph, and the goal is to simultaneously learn all these causal graphs. We study this problem without the causal sufficiency assumption, using Maximal Ancestral Graphs (MAG) to model the causal graphs, and assuming that we have the ability to actively perform independent single vertex (or atomic) interventions on the entities. If the $M$ underlying (unknown) causal graphs of the entities satisfy a natural notion of clustering, we give algorithms that leverage this property and recovers all the causal graphs using roughly logarithmic in $M$ number of atomic interventions per entity. These are significantly fewer than $n$ atomic interventions per entity required to learn each causal graph separately, where $n$ is the number of observable nodes in the causal graph. We complement our results with a lower bound and discuss various extensions of our collaborative setting.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑