知识卡片
前门表达式含两次标准化
标准单中介前门条件下,P(y|do(x))=Σ_w P(w|x)Σ_x′ P(y|w,x′)P(x′)。内层遍历自然处理分布x′,外层按干预x所诱导的中介分布加权;不能把内层x′固定为外层x,也不能保留不可观测混杂量作为最终表达式。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 识别与因果层级
原书出处 · 1 处
- · 查看原书依据
Graphical identification algorithms, often called ID algorithms, automate the application of graph-based identification systems like the do-calculus. When we used y0 to check for identification of P (IE=e ) and to derive the backdoor estimand, it was using its implementation of graphical identification algorithms. In this section, we’ll see how we can use these algorithms to identify another useful estimand called the front-door estimand.
参考来源
- 位置:《Causal AI》第10章《识别与因果层级》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Causal AI/_epub-src/OEBPS/Text/chapter-10.xhtml)
- 结论依据:摘录中关于前门表达式含两次标准化的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:Graphical identification algorithms, often called ID algorithms, automate the application of graph-based identification systems like the do-calculus. When we used y0 to check for identification of P (IE=e ) and to derive the backdoor estimand, it was using its implementation of graphical identification algorithms. In this section, we’ll see how we can use these algorithms to identify another useful estimand called the front-door estimand.