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.
Efficient Imputation for Patch-based Missing Single-cell Data via Cluster-regularized Optimal Transport
Department of Computer Science, Stony Brook University(计算机科学系,石板溪大学);Department of Computer Science, Emory University(计算机科学系,埃默里大学);Department of Population Health Sciences, Cornell University(流行病学与公共卫生系,康奈尔大学);Department of Computer Science and Engineering, Cornell University(计算机科学与工程系,康奈尔大学);Department of Biomedical Informatics, Stony Brook University(生物医学信息学系,石板溪大学)
缺失值的存在使得监督学习更具挑战性。事实上,以前的工作已经表明,即使响应是完整数据的线性函数,最佳预测器也是观察到的条目和缺失指标的复函数。因此,一致性方法的计算或样本复杂性取决于缺失模式的数量,其在维度数量上可以是指数级的。在这项工作中,我们推导出线性假设和各种缺失数据机制,包括随机缺失(MAR)和自屏蔽(Missing Not At Random)下的最佳预测的分析形式。基于Neumann级数近似的最优预测,我们提出了一个新的原则架构,命名为NeuMiss网络。它们的独创性和力量来自于使用一种新型的非线性:乘以缺失指标。我们提供了一个上限NeuMiss网络的贝叶斯风险,并表明他们有良好的预测精度与一些参数和独立的缺失数据模式的数量的计算复杂性。因此,它们可以很好地扩展到具有许多特征的问题,并且对于中等大小的样本仍然具有统计效率。此外,我们表明,相反的程序使用EM或插补,他们是强大的缺失数据机制,包括困难的MNAR设置,如自屏蔽。
Computational Efficient and Minimax Optimal Nonignorable Matrix Completion
School of Statistics, Renmin University of China(中国人民大学统计学院);Department of Probability and Statistics, School of Mathematical Sciences, Center for Statistical Science, Peking University(北京大学数学科学学院概率统计系、统计科学中心);Institute of Automation, Chinese Academy of Sciences(中国科学院自动化研究所)
Optimal transport mapping via input convex neural networks
University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);University of California, Irvine(加州大学欧文分校);Princeton University(普林斯顿大学);University of Washington(华盛顿大学)
On Scalable and Efficient Computation of Large Scale Optimal Transport
Georgia Institute of Technology(佐治亚理工学院)
最优传输(OT)自然出现在许多机器学习应用中,但沉重的计算负担限制了它的广泛应用。为了解决可扩展性问题,我们提出了一个基于隐式生成学习的框架,称为SPOT(Scalable Push-forward of Optimal Transport)。具体来说,我们近似的最优运输计划的推进的参考分布,并铸造的最优运输问题成一个极大极小问题。然后,我们可以有效地解决OT问题使用原始对偶随机梯度型算法。我们还表明,我们可以恢复密度的最佳运输计划,使用神经常微分方程。在模拟数据集和真实数据集上的数值实验表明,SPOT算法具有良好的收敛性和鲁棒性。SPOT还使我们能够从最佳传输计划中高效地进行采样,这有利于下游应用,如领域自适应。
Magnitude and Rotation Invariant Detection of Transportation Modes with Missing Data Modalities
IDLab, Ghent University-imec(IDLab,根特大学-imec);Institute for Clarity in Documentation(文档清晰度研究所);Inria Paris-Rocquencourt(法国国家信息与自动化研究所巴黎-罗康分所);Rajiv Gandhi University(拉吉夫·甘地大学);Tsinghua University(清华大学);Palmer Research Laboratories(帕尔默研究实验室)
Missingness-MDPs: Bridging the Theory of Missing Data and POMDPs
Ruhr University Bochum(博德姆鲁尔大学);Brno University of Technology(布拉格技术大学);Radboud University Nijmegen(拉德博德大学奈杰姆);Harvard University(哈佛大学);Eindhoven University of Technology(埃因霍温理工大学)