arXivDaily arXiv每日学术速递 周一至周五更新
今晚才能更新了~~大家休息下再来吧
arXiv 2205.02232cs.LGcs.AIstat.ME
收藏

用于因果效应识别的实验设计

Experimental Design for Causal Effect Identification

EPFL(洛桑联邦理工学院)

Sina Akbari, Jalal Etesami, Negar Kiyavash

AI总结:

本文研究因果效应不可识别时的最小成本干预实验设计问题,证明其 NP 难,并基于最小击中集提出最优或对数因子近似算法及多种多项式时间启发式方法。

摘要:

Pearl 的 do 演算(do-calculus)是一种完备的公理化方法,可用于从观测数据中学习可识别的因果效应。当此类效应不可识别时,就必须在系统中执行一组干预措施(这些干预往往代价高昂)以学习该因果效应。在本工作中,我们研究如何设计一组成本最低的干预措施,以识别目标效应。首先,我们证明该问题是 NP-hard(NP 难)的;随后,通过在该问题与最小击中集(minimum hitting set)问题之间建立联系,我们提出一种算法,该算法要么能找到最优解,要么能给出对数因子近似解。此外,我们还提出若干多项式时间启发式算法,以应对该问题的计算复杂性。尽管这些算法有可能得到次优解,但我们的仿真表明,它们在随机图上取得了较小的遗憾值(regret)。

英文摘要:

Pearl's do calculus is a complete axiomatic approach to learn the identifiable causal effects from observational data. When such an effect is not identifiable, it is necessary to perform a collection of often costly interventions in the system to learn the causal effect. In this work, we consider the problem of designing the collection of interventions with the minimum cost to identify the desired effect. First, we prove that this problem is NP-hard, and subsequently propose an algorithm that can either find the optimal solution or a logarithmic-factor approximation of it. This is done by establishing a connection between our problem and the minimum hitting set problem. Additionally, we propose several polynomial-time heuristic algorithms to tackle the computational complexity of the problem. Although these algorithms could potentially stumble on sub-optimal solutions, our simulations show that they achieve small regrets on random graphs.

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

↑