High dimensional precision matrix estimation under weak sparsity

07/07/2021
by   Zeyu Wu, et al.
0

In this paper, we estimate the high dimensional precision matrix under the weak sparsity condition where many entries are nearly zero. We study a Lasso-type method for high dimensional precision matrix estimation and derive general error bounds under the weak sparsity condition. The common irrepresentable condition is relaxed and the results are applicable to the weak sparse matrix. As applications, we study the precision matrix estimation for the heavy-tailed data, the non-paranormal data, and the matrix data with the Lasso-type method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/26/2019

Non-asymptotic error controlled sparse high dimensional precision matrix estimation

Estimation of a high dimensional precision matrix is a critical problem ...
research
06/27/2020

The flare Package for High Dimensional Linear Regression and Precision Matrix Estimation in R

This paper describes an R package named flare, which implements a family...
research
10/31/2021

Laplacian Constrained Precision Matrix Estimation: Existence and High Dimensional Consistency

This paper considers the problem of estimating high dimensional Laplacia...
research
06/28/2017

Asymptotic Confidence Regions for High-dimensional Structured Sparsity

In the setting of high-dimensional linear regression models, we propose ...
research
05/16/2022

GraphSPME: Markov Precision Matrix Estimation and Asymptotic Stein-Type Shrinkage

GraphSPME is an open source Python, R and C++ header-only package implem...
research
09/13/2023

CARE: Large Precision Matrix Estimation for Compositional Data

High-dimensional compositional data are prevalent in many applications. ...
research
05/18/2020

Effective Learning of a GMRF Mixture Model

Learning a Gaussian Mixture Model (GMM) is hard when the number of param...

Please sign up or login with your details

Forgot password? Click here to reset