arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2605.06993cs.AIstat.ML
收藏

部分因果效应识别的最优实验

Optimal Experiments for Partial Causal Effect Identification

Technical University of Munich(慕尼黑技术大学)

Tobias Maringgele, Jalal Etesami

AI总结:

本文研究在有限成本下选择实验以最紧缩目标因果查询的界限,提出max-potency问题并证明其NP难,通过图修剪策略高效筛选实验,实验证明在随机图和基准网络上显著减少候选实验数量。

摘要:

因果查询通常只能部分从观测数据中识别,而能收紧结果界限的实验通常成本高昂。本文研究在观察实验结果前,选择成本受限的实验子集以最大化紧缩目标查询的界限。我们将此问题形式化为max-potency问题,其中epistemic potency衡量实验保证的最坏界宽减少量,并通过0-1背包问题归约证明其NP难。基于Duarte等人(2023)的多项式编程框架,我们提供了一种在离散设置中评估epistemic potency的一般方法。为控制超指数搜索空间,我们引入两种图修剪准则,仅依赖因果图和查询:一种新的路径拦截规则利用区域结构在线性时间内认证零potency,另一种基于ID算法的可识别性检查。在Erdos-Renyi随机图和11个bnlearn基准网络上,两种准则共同平均修剪50-88%的候选实验,而无需求解单个多项式程序。对于一般子集搜索,我们证明ID修剪的实验具有组合惰性,导致评估的子集数量呈超指数减少。最后,我们通过观察NHANES数据进行端到端演示,选择最优实验估计体力活动对糖尿病的影响。

英文摘要:

Causal queries are often only partially identifiable from observational data, and experiments that could tighten the resulting bounds are typically costly. We study the problem of selecting, prior to observing experimental outcomes, a cost-constrained subset of experiments that maximally tightens bounds on a target query. We formalize this as the max-potency problem, where epistemic potency measures the worst-case reduction in bound width guaranteed by an experiment, and show that this problem is NP-hard via a reduction from 0-1 knapsack. Building on the polynomial-programming framework of Duarte et al. (2023), we give a general procedure for evaluating epistemic potency in discrete settings. To control the super-exponential search space, we introduce two graphical pruning criteria that depend only on the causal graph and the query: a novel path-interception rule that exploits district structure to certify zero potency in linear time, and an identifiability check based on the ID algorithm. On Erdos-Renyi random graphs and 11 bnlearn benchmark networks, the two criteria together prune 50-88% of candidate experiments on average without solving a single polynomial program. For the general subset search, we show that ID-pruned experiments are combinatorially inert, yielding a super-exponential reduction in the number of subsets evaluated. We close with an end-to-end demonstration on observational NHANES data, selecting optimal experiments for estimating the effect of physical activity on diabetes.

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

↑