发帖
雷达卡
摘要翻译：
我们讨论了从一个更易于操作的不同集合Z上的实验中估计干预对一组变量X的影响的问题。这个问题，我们称之为Z-可识别性，当Z=空时，它被简化为普通的可识别性，并且像后者一样，可以使用do-calculus给出句法特征[Pearl,1995；2000]。本文给出了任意集合X，Z，Y（其结果）的Z-可辨识性的一个图的充要条件。最后，我们用我们的结果证明了Do-演算相对于Z-可辨识性的完备性，这是相对于普通可辨识性的完备性所没有的结果。
---
英文标题：
《Causal Inference by Surrogate Experiments: z-Identifiability》
---
作者：
Elias Bareinboim, Judea Pearl
---
最新提交年份：
2012
---
分类信息：
一级分类：Computer Science 计算机科学
二级分类：Artificial Intelligence 人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--
一级分类：Statistics 统计学
二级分类：Methodology 方法论
分类描述：Design, Surveys, Model Selection, Multiple Testing, Multivariate Methods, Signal and Image Processing, Time Series, Smoothing, Spatial Statistics, Survival Analysis, Nonparametric and Semiparametric Methods
设计，调查，模型选择，多重检验，多元方法，信号和图像处理，时间序列，平滑，空间统计，生存分析，非参数和半参数方法
--
---
英文摘要：
We address the problem of estimating the effect of intervening on a set of variables X from experiments on a different set, Z, that is more accessible to manipulation. This problem, which we call z-identifiability, reduces to ordinary identifiability when Z = empty and, like the latter, can be given syntactic characterization using the do-calculus [Pearl, 1995; 2000]. We provide a graphical necessary and sufficient condition for z-identifiability for arbitrary sets X,Z, and Y (the outcomes). We further develop a complete algorithm for computing the causal effect of X on Y using information provided by experiments on Z. Finally, we use our results to prove completeness of do-calculus relative to z-identifiability, a result that does not follow from completeness relative to ordinary identifiability.
---
PDF链接：
https://arxiv.org/pdf/1210.4842
京公网安备 11010802022788号
