arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2301.08230stat.MLcs.LG
收藏

基于得分的带干预因果表示学习

Score-based Causal Representation Learning with Interventions

Rensselaer Polytechnic Institute(伦斯勒理工学院);Google(谷歌)

Burak Varici, Emre Acarturk, Karthikeyan Shanmugam, Abhishek Kumar, Ali Tajer

AI总结:

本文研究潜在因果变量经未知线性变换间接观测下的因果表示学习问题,提出基于得分函数跨环境最小变化的方法,仅用软干预完美恢复潜在DAG,硬干预下还可恢复线性变换与因果排序。

摘要:

本文研究潜在因果变量通过未知线性变换被间接观测时的因果表示学习问题,目标为:(i) 恢复未知线性变换(在缩放意义下),(ii) 确定潜在变量背后的有向无环图(DAG)。本文建立了DAG恢复的充分条件,并证明潜在空间中一大类非线性模型(例如由两层神经网络参数化的因果机制)满足这些条件。这些充分条件确保能从得分的变化中正确检测到干预的效果。利用这一特性,可借助以下关键性质促进有效变换的恢复:任何有效变换都会使潜在变量的得分函数在不同干预环境下的变化必然最小。本文利用该性质仅通过软干预即可完美恢复潜在DAG结构。对于随机硬干预的特殊情况,通过额外的假设检验步骤,还能唯一恢复在缩放意义下的线性变换以及有效的因果排序。

英文摘要:

This paper studies the causal representation learning problem when the latent causal variables are observed indirectly through an unknown linear transformation. The objectives are: (i) recovering the unknown linear transformation (up to scaling) and (ii) determining the directed acyclic graph (DAG) underlying the latent variables. Sufficient conditions for DAG recovery are established, and it is shown that a large class of non-linear models in the latent space (e.g., causal mechanisms parameterized by two-layer neural networks) satisfy these conditions. These sufficient conditions ensure that the effect of an intervention can be detected correctly from changes in the score. Capitalizing on this property, recovering a valid transformation is facilitated by the following key property: any valid transformation renders latent variables' score function to necessarily have the minimal variations across different interventional environments. This property is leveraged for perfect recovery of the latent DAG structure using only \emph{soft} interventions. For the special case of stochastic \emph{hard} interventions, with an additional hypothesis testing step, one can also uniquely recover the linear transformation up to scaling and a valid causal ordering.

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

↑