arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.15255cs.LGcs.AI
收藏

缺失数据下结构学习的最优传输

Optimal Transport for Structure Learning Under Missing Data

Monash University(莫纳什大学);CSIRO’s Data61(联邦科学与工业研究组织数据61部);VinAI Research(VinAI研究院)

Vy Vo, He Zhao, Trung Le, Edwin V. Bonilla, Dinh Phung

AI总结:

针对缺失数据下因果发现的困境,提出一种基于最优传输和分数的算法,将结构学习转化为密度拟合问题,寻找与观测数据分布Wasserstein距离最小的因果模型,实验证明其恢复因果图更有效且具可扩展性。

摘要:

在存在缺失数据的情况下进行因果发现会引发鸡生蛋还是蛋生鸡的困境。虽然目标是恢复真实的因果结构,但稳健的插补需要考虑变量之间的依赖关系,或者最好是因果关系。经验表明,仅用现有的插补方法填补缺失值,随后在完整数据上应用结构学习是次优的。为了解决这个问题,我们提出了一种基于最优传输的基于分数的算法,用于从缺失数据中学习因果结构。这种最优传输观点有别于现有主要基于期望最大化的基于分数的方法。我们将结构学习表述为一个密度拟合问题,其目标是找到诱导出与观测数据分布具有最小Wasserstein距离的分布的因果模型。实验表明,在大多数模拟和真实数据设置中,我们的框架比竞争方法能更有效地恢复真实的因果图。经验证据还表明,我们的方法具有卓越的可扩展性,并且能够灵活地结合任何现成的完整数据因果发现方法。

英文摘要:

Causal discovery in the presence of missing data introduces a chicken-and-egg dilemma. While the goal is to recover the true causal structure, robust imputation requires considering the dependencies or, preferably, causal relations among variables. Merely filling in missing values with existing imputation methods and subsequently applying structure learning on the complete data is empirically shown to be sub-optimal. To address this problem, we propose a score-based algorithm for learning causal structures from missing data based on optimal transport. This optimal transport viewpoint diverges from existing score-based approaches that are dominantly based on expectation maximization. We formulate structure learning as a density fitting problem, where the goal is to find the causal model that induces a distribution of minimum Wasserstein distance with the observed data distribution. Our framework is shown to recover the true causal graphs more effectively than competing methods in most simulations and real-data settings. Empirical evidence also shows the superior scalability of our approach, along with the flexibility to incorporate any off-the-shelf causal discovery methods for complete data.

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

↑