跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要直接研究因果发现、混杂变量调整和平均处理效应的选择后置信集合,属于因果推断方向。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Ting-Hsuan Chang
Zijian Guo
Daniel Malinsky

因果发现后因果效应的选择后推断

研究问题
同一数据既用于选择因果图又用于估计效应时,如何处理选择误差,并对固定的总体因果效应构造有效置信集合?
方法与思路
作者通过重抽样与筛选扰动中间检验统计量,重复执行因果发现,再汇集各图下的效应估计并取置信区间并集。
材料陈述的贡献
摘要称,所构造集合对真实且固定的因果效应具有渐近正确覆盖;方法主要以PC算法和多元高斯情形展开。
阅读关注点
应核对因果识别与图筛选所需条件、扰动和筛选规则,以及候选图覆盖、置信集合宽度和计算成本之间的关系。
阅读边界
仅依据所给Crossref摘要;识别假设与覆盖证明条件未说明,作者所称模块化推广不能据此视为对所有算法和分布均有效。

原文摘要

Summary Algorithms for constraint-based causal discovery select graphical causal models among a space of possible candidates (e.g., all directed acyclic graphs) by executing a sequence of conditional independence tests. These may be used to inform the estimation of causal effects (e.g., average treatment effects) when there is uncertainty about which covariates ought to be adjusted for, or which variables act as confounders versus mediators. However, naively using the data twice, for model selection and estimation, would lead to invalid confidence intervals. Moreover, if the selected graph is incorrect, the inferential claims may apply to a selected functional that is distinct from the actual causal effect. We propose an approach to post-selection inference that is based on a resampling and screening procedure, which essentially performs causal discovery multiple times with randomly varying intermediate test statistics. Then, an estimate of the target causal effect and corresponding confidence sets are constructed from a union of individual graph-based estimates and intervals. We show that this construction has asymptotically correct coverage for the true causal effect parameter. Importantly, the guarantee holds for a fixed population-level effect, not a data-dependent or selection-dependent quantity. Most of our exposition focuses on the PC algorithm for learning directed acyclic graphs and on the multivariate Gaussian case for simplicity, but the approach is general and modular, so it may be used with other conditional-independence-based discovery algorithms and distributional families.

笔记与分组