arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1507.02018math.STstat.TH
收藏

使用l1-penalized似然性推断大型图

Inferring large graphs using l1-penalized likelihood

Magali Champion, Victor Picheny, Matthieu Vignes

摘要:

我们解决的问题,恢复结构的大型稀疏有向无圈图从嘈杂的观察系统。我们提出了一种新的程序的基础上的l1-范数正则化最大似然的特定配方,它分解成两个优化子问题的图估计:拓扑结构和节点顺序学习。我们提供了甲骨文不等式的图形估计,以及一个算法来解决诱导最优化问题,在一个凸计划嵌入在遗传算法的形式。我们将我们的方法应用于各种数据集(包括来自DREAM 4挑战的数据),并表明它与最先进的方法相比毫不逊色。

英文摘要:

We address the issue of recovering the structure of large sparse directed acyclic graphs from noisy observations of the system. We propose a novel procedure based on a specific formulation of the l1-norm regularized maximum likelihood, which decomposes the graph estimation into two optimization sub-problems: topological structure and node order learning. We provide oracle inequalities for the graph estimator, as well as an algorithm to solve the induced optimization problem, in the form of a convex program embedded in a genetic algorithm. We apply our method to various data sets (including data from the DREAM4 challenge) and show that it compares favorably to state-of-the-art methods.

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

↑