0


高维图形模型选择

High-Dimensional Graphical Model Selection
课程网址: http://videolectures.net/nips2011_anandkumar_conditions/  
主讲教师: Animashree Anandkumar
开课单位: 加利福尼亚大学
开课时间: 2012-01-25
课程语种: 英语
中文简介:
在n i.i.d中我们考虑了Ising和Gaussian图形模型选择的问题。来自模型的样本。我们提出了一种基于有效阈值的结构估计算法,称为条件互信息测试。这种简单的本地算法仅需要数据的低阶统计量,并确定两个节点是否是未知图中的邻居。在一些透明的假设下,我们确定当样本数量缩放为n = Omega(J_ {min} ^ {4} log p)时,所提出的算法在结构上是一致的(或sparsistent),其中p是节点数和J_ {min}是最小边缘潜力。我们还证明了图形模型选择的新的非渐近必要条件。
课程简介: We consider the problem of Ising and Gaussian graphical model selection given n i.i.d. samples from the model. We propose an efficient threshold-based algorithm for structure estimation based known as conditional mutual information test. This simple local algorithm requires only low-order statistics of the data and decides whether two nodes are neighbors in the unknown graph. Under some transparent assumptions, we establish that the proposed algorithm is structurally consistent (or sparsistent) when the number of samples scales as n= Omega(J_{min}^{-4} log p), where p is the number of nodes and J_{min} is the minimum edge potential. We also prove novel non-asymptotic necessary conditions for graphical model selection.
关 键 词: 图形模型选择; 结构估计算法; 低阶统计量
课程来源: 视频讲座网
最后编审: 2019-07-26:cwx
阅读次数: 45