High-Dimensional Graphical Model Selection: Tractable Graph Families and Necessary Conditions

2011-12-01 · NeurIPS 2011 12 · Animashree Anandkumar, Vincent Tan, Alan S. Willsky

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.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Model SelectionVocal Bursts Intensity Prediction

Nonparametric undirected graphical model selection using diffusion models

2026-06-07 · Hyeok Kyu Kwon, Myeonggu Kang, Minwoo Chae, Wanjie Wang arxiv

Undirected graphical models provide a fundamental framework for representing conditional independence structures among high-dimensional random variables. While undirected graphical model selection has become a central pr…

Model Selection With Graphical Neighbour Information

2019-08-27 · Robert O'Shea

Accurate model selection is a fundamental requirement for statistical analysis. In many real-world applications of graphical modelling, correct model structure identification is the ultimate objective. Standard model val…

model Model Selection

Dependence model assessment and selection with DecoupleNets

2022-02-07 · Marius Hofert, Avinash Prasad, Mu Zhu

Neural networks are suggested for learning a map from $d$-dimensional samples with any underlying dependence structure to multivariate uniformity in $d'$ dimensions. This map, termed DecoupleNet, is used for dependence m…

model Model Selection

Graphical Nonconvex Optimization via an Adaptive Convex Relaxation

2018-07-01 · ICML 2018 7 · Qiang Sun, Kean Ming Tan, Han Liu, Tong Zhang

We consider the problem of learning high-dimensional Gaussian graphical models. The graphical lasso is one of the most popular methods for estimating Gaussian graphical models. However, it does not achieve the oracl…

Graphical Nonconvex Optimization for Optimal Estimation in Gaussian Graphical Models

2017-06-04 · Qiang Sun, Kean Ming Tan, Han Liu, Tong Zhang