Recently, a special case of precision matrix estimation based on a distributionally robust optimization (DRO) framework has been shown to be equivalent to the graphical lasso. From this formulation, a method for choosing the regularization term, i.e., for graphical model selection, was proposed. In this work, we establish a theoretical connection between the confidence level of graphical model selection via the DRO formulation and the asymptotic family-wise error rate of estimating false edges. Simulation experiments and real data analyses illustrate the utility of the asymptotic family-wise error rate control behavior even in finite samples
Penalized inference of Gaussian graphical models is a way to assess the conditional independence str...
We propose a new procedure for optimally estimating high dimensional Gaussian graphical models. Our ...
<p>Gaussian graphical models represent the underlying graph structure of conditional dependence betw...
The majority of methods for sparse precision matrix estimation rely on computationally expensive pro...
The majority of methods for sparse precision matrix estimation rely on computationally expensive pro...
Building on a recent framework for distributionally robust optimization, we considerestimation of th...
Building on a recent framework for distributionally robust optimization, we considerestimation of th...
Building on a recent framework for distributionally robust optimization, we considerestimation of th...
We propose penalized likelihood methods for estimating the concentration matrix in the Gaussian grap...
A Gaussian graphical model is a graph representation of conditional independence relations among Gau...
The graphical lasso [5] is an algorithm for learning the structure in an undirected Gaussian graphic...
Inspired by the success of the Lasso for regression analysis, it seems attractive to estimate the gr...
Penalized inference of Gaussian graphical models is a way to assess the conditional independence str...
We propose penalized likelihood methods for estimating the concentration matrix in the Gaussian grap...
Penalized inference of Gaussian graphical models is a way to assess the conditional independence str...
Penalized inference of Gaussian graphical models is a way to assess the conditional independence str...
We propose a new procedure for optimally estimating high dimensional Gaussian graphical models. Our ...
<p>Gaussian graphical models represent the underlying graph structure of conditional dependence betw...
The majority of methods for sparse precision matrix estimation rely on computationally expensive pro...
The majority of methods for sparse precision matrix estimation rely on computationally expensive pro...
Building on a recent framework for distributionally robust optimization, we considerestimation of th...
Building on a recent framework for distributionally robust optimization, we considerestimation of th...
Building on a recent framework for distributionally robust optimization, we considerestimation of th...
We propose penalized likelihood methods for estimating the concentration matrix in the Gaussian grap...
A Gaussian graphical model is a graph representation of conditional independence relations among Gau...
The graphical lasso [5] is an algorithm for learning the structure in an undirected Gaussian graphic...
Inspired by the success of the Lasso for regression analysis, it seems attractive to estimate the gr...
Penalized inference of Gaussian graphical models is a way to assess the conditional independence str...
We propose penalized likelihood methods for estimating the concentration matrix in the Gaussian grap...
Penalized inference of Gaussian graphical models is a way to assess the conditional independence str...
Penalized inference of Gaussian graphical models is a way to assess the conditional independence str...
We propose a new procedure for optimally estimating high dimensional Gaussian graphical models. Our ...
<p>Gaussian graphical models represent the underlying graph structure of conditional dependence betw...