We propose a new procedure for estimating high dimensional Gaussian graphical models. Our approach is asymptotically tuning-free and non-asymptotically tuning-insensitive: it requires very few efforts to choose the tuning parameter in finite sample settings. Computationally, our procedure is significantly faster than existing methods due to its tuning-insensitive property. Theoretically, the obtained estimator is simulta-neously minimax optimal for precision matrix estimation under different norms. Em-pirically, we illustrate the advantages of our method using thorough simulated and real examples. The R package bigmatrix implementing the proposed methods is available on the Comprehensive R Archive Network
We propose graphical sure screening, or GRASS, a very simple and computationally-efficient screen-in...
Gaussian graphical models (GGM) have been widely used in many high-dimensional applications ranging ...
The thesis considers the estimation of sparse precision matrices in the highdimensional setting. Fir...
We propose a new procedure for optimally estimating high dimensional Gaussian graphical models. Our ...
The majority of methods for sparse precision matrix estimation rely on computationally expensive pro...
High-dimensional data refers to the case in which the number of parameters is of one or more order g...
A Gaussian graphical model is a graph representation of conditional independence relations among Gau...
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...
This work is linked to the theories of non-parametric statistics, statistical learning, and spatial ...
Latent Gaussian graphical models are very useful in probabilistic modeling to measure the statistica...
This paper studies the estimation of high dimensional Gaussian graphical model (GGM). Typically, the...
We consider the problem of estimating a sparse Gaussian Graphical Model with a special graph topolog...
Recently, a special case of precision matrix estimation based on a distributionally robust optimizat...
We propose penalized likelihood methods for estimating the concentration matrix in the Gaussian grap...
We propose graphical sure screening, or GRASS, a very simple and computationally-efficient screen-in...
Gaussian graphical models (GGM) have been widely used in many high-dimensional applications ranging ...
The thesis considers the estimation of sparse precision matrices in the highdimensional setting. Fir...
We propose a new procedure for optimally estimating high dimensional Gaussian graphical models. Our ...
The majority of methods for sparse precision matrix estimation rely on computationally expensive pro...
High-dimensional data refers to the case in which the number of parameters is of one or more order g...
A Gaussian graphical model is a graph representation of conditional independence relations among Gau...
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...
This work is linked to the theories of non-parametric statistics, statistical learning, and spatial ...
Latent Gaussian graphical models are very useful in probabilistic modeling to measure the statistica...
This paper studies the estimation of high dimensional Gaussian graphical model (GGM). Typically, the...
We consider the problem of estimating a sparse Gaussian Graphical Model with a special graph topolog...
Recently, a special case of precision matrix estimation based on a distributionally robust optimizat...
We propose penalized likelihood methods for estimating the concentration matrix in the Gaussian grap...
We propose graphical sure screening, or GRASS, a very simple and computationally-efficient screen-in...
Gaussian graphical models (GGM) have been widely used in many high-dimensional applications ranging ...
The thesis considers the estimation of sparse precision matrices in the highdimensional setting. Fir...