Identifying cause-effect relations among variables is a key step in the decision-making process. While causal inference requires randomized experiments, researchers and policymakers are increasingly using observational studies to test causal hypotheses due to the wide availability of observational data and the infeasibility of experiments. The matching method is the most used technique to make causal inference from observational data. However, the pair assignment process in one-to-one matching creates uncertainty in the inference because of different choices made by the experimenter. Recently, discrete optimization models are proposed to tackle such uncertainty. Although a robust inference is possible with discrete optimization models, they produce nonlinear problems and lack scalability. In this work, we propose greedy algorithms to solve the robust causal inference test instances from observational data with continuous outcomes. We propose a unique framework to reformulate the nonlinear binary optimization problems as feasibility problems. By leveraging the structure of the feasibility formulation, we develop greedy schemes that are efficient in solving robust test problems. In many cases, the proposed algorithms achieve global optimal solutions. We perform experiments on three real-world datasets to demonstrate the effectiveness of the proposed algorithms and compare our result with the state-of-the-art solver. Our experiments show that the proposed algorithms significantly outperform the exact method in terms of computation time while achieving the same conclusion for causal tests. Both numerical experiments and complexity analysis demonstrate that the proposed algorithms ensure the scalability required for harnessing the power of big data in the decision-making process.
A Versatile Causal Discovery Framework to Allow Causally-Related Hidden Variables
University of California San Diego（加州大学圣地亚哥分校）；Carnegie Mellon University（卡内基梅隆大学）；Mohamed bin Zayed University of Artificial Intelligence（穆罕默德·本·扎耶德人工智能大学）；KDDI Research（KDDI研究所）
German Aerospace Center (DLR), Institute of Data Science（德国航空航天中心（DLR）数据科学研究所）；Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI) Dresden/Leipzig, TU Dresden（德累斯顿工业大学可扩展数据分析与人工智能中心（ScaDS.AI）德累斯顿/莱比锡）
Institute of Science and Technology Austria (ISTA)（奥地利科学与技术研究所）；Massachusetts Institute of Technology (MIT)（麻省理工学院）；Department of Computer Science, ETH Zurich（苏黎世联邦理工学院计算机科学系）；INRIA, Ecole Normale Supérieure, CNRS, PSL Research University（法国国家信息与自动化研究所、巴黎高等师范学校、法国国家科学研究中心、巴黎-萨克勒大学）
Northwestern Polytechnical University（西北工业大学）；Center for Excellence in Molecular Cell Science, Chinese Academy of Sciences（中国科学院分子细胞科学卓越创新中心）；Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院）；University of Chinese Academy of Sciences（中国科学院大学）；South China University of Technology（华南理工大学）；Guangdong Institute of Intelligence Science and Technology（广东智能科学技术研究院）；Fudan University（复旦大学）；Shanghai Artificial Intelligence Laboratory（上海人工智能实验室）；Hangzhou Institute for Advanced Study, University of Chinese Academy of Sciences（中国科学院大学杭州高等研究院）
ProximalFM: Amortized Proximal Causal Inference under Hidden Confounding
University of Oxford（牛津大学）；Harvard University（哈佛大学）；University of Illinois Urbana-Champaign（伊利诺伊大学厄巴纳-香槟分校）；Perelman School of Medicine, University of Pennsylvania（宾夕法尼亚大学佩雷尔曼医学院）；Vector Institute（向量研究所）；University College London（伦敦大学学院）
