arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.00993stat.MLcs.LGstat.ME
收藏

非配对多领域因果表示学习

Unpaired Multi-Domain Causal Representation Learning

Technical University of Munich(慕尼黑工业大学);Munich Center for Machine Learning(慕尼黑机器学习中心);LIDS, Massachusetts Institute of Technology(麻省理工学院信息与决策系统实验室);Broad Institute of MIT and Harvard(布罗德研究所)

Nils Sturma, Chandler Squires, Mathias Drton, Caroline Uhler

AI总结:

本文研究非配对多领域数据下的因果表示学习,在线性设定下给出联合分布与共享因果图的可识别性条件,并提出从各领域边际分布恢复共享潜在因果图的实用方法。

摘要:

因果表示学习的目标是找到由具有因果关系的潜在变量构成的数据表示。我们考虑一种设定,其中可以获取来自多个领域的数据,这些领域可能共享一个因果表示。关键的是,不同领域中的观测被假设为非配对的,即我们只能观测到每个领域的边际分布,而无法观测它们的联合分布。在本文中,我们在线性设定下给出了联合分布和共享因果图可识别性的充分条件。如果能够从每个领域的边际分布中唯一地恢复联合分布和共享因果表示,则可识别性成立。我们将可识别性结果转化为一种实用方法,用于恢复共享的潜在因果图。

英文摘要:

The goal of causal representation learning is to find a representation of data that consists of causally related latent variables. We consider a setup where one has access to data from multiple domains that potentially share a causal representation. Crucially, observations in different domains are assumed to be unpaired, that is, we only observe the marginal distribution in each domain but not their joint distribution. In this paper, we give sufficient conditions for identifiability of the joint distribution and the shared causal graph in a linear setup. Identifiability holds if we can uniquely recover the joint distribution and the shared causal representation from the marginal distributions in each domain. We transform our identifiability results into a practical method to recover the shared latent causal graph.

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

↑