Fast and adaptive sparse precision matrix estimation in high dimensions
From MaRDI portal
Publication:2256755
DOI10.1016/j.jmva.2014.11.005zbMath1307.62148arXiv1203.3896OpenAlexW2087760247WikidataQ35140950 ScholiaQ35140950MaRDI QIDQ2256755
Publication date: 20 February 2015
Published in: Journal of Multivariate Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.3896
Related Items (16)
Sparse graphical models via calibrated concave convex procedure with application to fMRI data ⋮ Scalable inference for high-dimensional precision matrix ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Greedy Algorithm for Sparse Precision Matrix Approximation ⋮ Differentially private precision matrix estimation ⋮ Precision matrix estimation using penalized generalized Sylvester matrix equation ⋮ Causal Structural Learning via Local Graphs ⋮ Block-diagonal precision matrix regularization for ultra-high dimensional data ⋮ Innovated scalable dynamic learning for time-varying graphical models ⋮ A unified precision matrix estimation framework via sparse column-wise inverse operator under weak sparsity ⋮ Estimating covariance and precision matrices along subspaces ⋮ Penalized Interaction Estimation for Ultrahigh Dimensional Quadratic Regression ⋮ An efficient ADMM algorithm for high dimensional precision matrix estimation via penalized quadratic loss ⋮ A scalable sparse Cholesky based approach for learning high-dimensional covariance matrices in ordered data ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparse inverse covariance estimation with the graphical lasso
- Optimal rates of convergence for covariance matrix estimation
- Covariance regularization by thresholding
- Sparsistency and rates of convergence in large covariance matrix estimation
- Sparse permutation invariant covariance estimation
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- Network exploration via the adaptive LASSO and SCAD penalties
- High-dimensional graphs and variable selection with the Lasso
- Sparse Matrix Inversion with Scaled Lasso
- A Constrainedℓ1Minimization Approach to Sparse Precision Matrix Estimation
- Adaptive Thresholding for Sparse Covariance Matrix Estimation
- Model selection and estimation in the Gaussian graphical model
- First-Order Methods for Sparse Covariance Selection
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Random forests
This page was built for publication: Fast and adaptive sparse precision matrix estimation in high dimensions
