NSF-BSF: AF: Small: Algorithmic and Information-Theoretic Challenges in Causal Inference

科学研究往往是为了回答在公共卫生，医学，经济或教育政策，监管政策，商业决策等各个领域的因果关系的问题，然而，正是因为这么多的利害关系，在许多这些问题，科学家经常被排除在伦理或其他限制解决他们与随机对照试验（RCT），实验研究的黄金标准这往往是在涉及公共利益的事项中确定因果关系的最大障碍之一。因果网络框架是一种相对较新的科学方法，它使人们能够编纂假设，即系统的某些部分对其他部分没有直接影响（不排除间接影响）。当某些假设是合理的，原则上可以使用纯观察数据代替RCT来确定因果关系。然而，现有的方法仅在很窄的假设范围内是合理的，并且通常不能很好地扩展到大型网络。该项目将由研究者、学生、博士后和合作者共同开展，致力于通过新的算法和样本复杂性界限，以及可能发生在大型稀疏因果网络中的相关性强度界限，来增加此类方法的适用范围。在基本层面上，严格因果推理存在两个障碍：潜在混杂和选择偏差。潜在混杂的发生是因为系统的重要方面不能（或没有）被观察到。如果数据仅在与感兴趣的量相关的特殊情况下记录，则会发生选择偏倚。全局混杂因素（影响所有可观测量的混杂因素）的存在排除了因果识别的可能性-除非引入额外的假设。其中之一是在全局混杂因素范围上的基数约束;然而，现有方法还需要统计分离假设。本项目的工作旨在放松这一假设，有利于Wasserstein距离中的模型识别。该项目还寻求超越单一的全球混杂因素，以有效治疗多种全球混杂因素。该项目的另一个目标是将因果网络应用于时间序列数据的分析，这是一个目前具有独特方法的主题。该项目的一个关键目标是提供强信息不等式：一个特殊的情况下，强数据处理不等式，已经研究了噪声通道的级联，因果网络的最简单的例子;但这种类型的网络是未知的潜在混杂和选择偏差。该项目的另一个目标是提供因果发现方法（使用统计数据而不是领域知识来确定网络结构），这些方法有效地工作，并且对噪声具有鲁棒性，尽管基数有限的全球混淆因素。该奖项反映了NSF的法定使命，并被认为值得通过使用基金会的智力价值和更广泛的影响审查标准进行评估来支持。

Scientific research is often intended to answer questions of causal effect in various domains such as public health, medicine, economic or educational policy, regulatory policy, business decisions, etc. However, precisely because so much is at stake in many of these questions, scientists are frequently precluded by ethical or other constraints from addressing them with a randomized controlled trial (RCT), the gold standard for experimental research. This has often been one of the greatest barriers to establishing cause and effect in matters of public interest. The framework of causal networks is a relatively recent elaboration of the scientific method which enables one to codify assumptions that some parts of a system have no direct effect on some others (without ruling out indirect effects). When certain assumptions are justified, one can in principle use purely observational data in lieu of RCTs to determine causal effects. However, existing methods are justified only within a narrow range of assumptions and often do not scale well to large networks. This project, to be carried out by the investigator, students, postdocs and collaborators, is dedicated to increasing the range of applicability of such methods with new algorithms and sample complexity bounds, as well as bounds on the strength of correlations that can occur in large, sparse causal networks.At a fundamental level, there are two obstacles to rigorous causal inference: latent confounding and selection bias. Latent confounding occurs because significant aspects of the system cannot (or have not) been observed. Selection bias occurs if data is recorded only under special circumstances that are correlated with the quantities of interest. The presence of a global confounder (one which affects all observables) rules out causal identification---unless additional assumptions are introduced. One such is a cardinality bound on the range of the global confounder; however, existing methods require in addition a statistical separation assumption. Work in this project aims to relax this assumption in favor of model identification in Wasserstein distance. The project also seeks to move beyond a single global confounder to efficient treatment of multiple global confounders. Another goal of the project is to apply causal networks to the analysis of time series data, a topic with a currently distinct methodology. A key goal of the project is to provide strong information inequalities: a special case, strong data processing inequalities, have been studied for concatenations of noisy channels, the simplest example of a causal network; but nothing of this type is known for networks with latent confounding and selection bias. A further goal of the project is to give methods for causal discovery (the use of statistical data rather than domain knowledge to determine network structure) that work efficiently and are robust to noise despite a cardinality-bounded global confounder.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.