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

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

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

本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。

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

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

分类依据与纠错

AI 根据所提供的论文材料归类:摘要直接讨论潜在结构因果模型、干预假设与反事实估计的理论保证。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

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

关注这篇论文的作者
Zeyu Zhou
Ruqi Bai
Sean Kulinski
Murat Kocaoglu
David I. Inouye

可逆潜在因果模型中领域反事实的刻画

研究问题
观测是潜在因果变量的非线性混合时,能否无需完整恢复潜在结构因果模型,估计同一样本若产生于另一环境时的反事实?
方法与思路
作者在可逆性与干预稀疏性假设下推导反事实估计误差界,并将算法化为带自回归和共享参数约束的生成模型估计。
材料陈述的贡献
摘要称,领域反事实估计不必恢复完整潜在因果模型,其误差可由数据拟合项和干预稀疏项界定;模拟和图像实验显示相对基准的改善。
阅读关注点
应核对领域反事实的精确定义、可逆性与稀疏干预的含义、误差界使用的距离,以及共享参数约束如何对应理论要求。
阅读边界
所据为 arXiv 预印本,不能据此认定已同行评审或获期刊接收;摘要未给出误差界的具体形式,也不能据此认定任意反事实查询可识别。

原文摘要

Answering counterfactual queries has important applications such as explainability, robustness, and fairness but is challenging when the causal variables are unobserved and the observations are non-linear mixtures of these latent variables, such as pixels in images. One approach is to recover the latent Structural Causal Model (SCM), which may be infeasible in practice due to requiring strong assumptions, e.g., linearity of the causal mechanisms or perfect atomic interventions. Meanwhile, more practical ML-based approaches using naive domain translation models to generate counterfactual samples lack theoretical grounding and may construct invalid counterfactuals. In this work, we strive to strike a balance between practicality and theoretical guarantees by analyzing a specific type of causal query called domain counterfactuals, which hypothesizes what a sample would have looked like if it had been generated in a different domain (or environment). We show that recovering the latent SCM is unnecessary for estimating domain counterfactuals, thereby sidestepping some of the theoretic challenges. By assuming invertibility and sparsity of intervention, we prove domain counterfactual estimation error can be bounded by a data fit term and intervention sparsity term. Building upon our theoretical results, we develop a theoretically grounded practical algorithm that simplifies the modeling process to generative model estimation under autoregressive and shared parameter constraints that enforce intervention sparsity. Finally, we show an improvement in counterfactual estimation over baseline methods through extensive simulated and image-based experiments.

笔记与分组