arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2006.11970stat.MLcs.LGmath.STstat.TH

A polynomial-time algorithm for learning nonparametric causal graphs

University of Chicago(芝加哥大学)

Ming Gao, Yi Ding, Bryon Aragam

英文摘要:

We establish finite-sample guarantees for a polynomial-time algorithm for learning a nonlinear, nonparametric directed acyclic graphical (DAG) model from data. The analysis is model-free and does not assume linearity, additivity, independent noise, or faithfulness. Instead, we impose a condition on the residual variances that is closely related to previous work on linear models with equal variances. Compared to an optimal algorithm with oracle knowledge of the variable ordering, the additional cost of the algorithm is linear in the dimension $d$ and the number of samples $n$. Finally, we compare the proposed algorithm to existing approaches in a simulation study.

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

↑