We consider the problem of estimating the skeleton of a large causal polytree from a relatively small i.i.d. sample. This is motivated by the problem of determining causal structure when the number of variables is very large compared to the sample size, such as in gene regulatory networks. We give an algorithm that recovers the tree with high accuracy in such settings. The algorithm works under essentially no distributional or modeling assumptions other than some mild non-degeneracy conditions.
翻译:我们考虑从相对小的 i.d.样本中估计大因果多树骨架的问题,其动机是确定因果结构的问题,当变量数量与样本规模相比非常大时,例如在基因管理网络中。我们给出一种算法,在这种环境中以很高的精确度回收树。算法基本上没有分布或建模假设,除了一些温和的非退化条件之外。