First-Order Methods for Sparse Covariance Selection
From MaRDI portal
Abstract: Given a sample covariance matrix, we solve a maximum likelihood problem penalized by the number of nonzero coefficients in the inverse covariance matrix. Our objective is to find a sparse representation of the sample data and to highlight conditional independence relationships between the sample variables. We first formulate a convex relaxation of this combinatorial problem, we then detail two efficient first-order algorithms with low memory requirements to solve large-scale, dense problem instances.
Recommendations
- Adaptive First-Order Methods for General Sparse Inverse Covariance Selection
- Fast algorithms for sparse inverse covariance estimation
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- Sparse estimation of a covariance matrix
- Sparse inverse covariance estimation with the graphical lasso
Cited in
(99)- Covariance regularization by thresholding
- Operator norm consistent estimation of large-dimensional sparse covariance matrices
- Sparsistency and rates of convergence in large covariance matrix estimation
- Estimating sufficient reductions of the predictors in abundant high-dimensional regressions
- Confidence intervals for high-dimensional inverse covariance estimation
- Asymptotic normality and optimalities in estimation of large Gaussian graphical models
- Gaussian graphical model estimation with false discovery rate control
- Adjusted regularization of cortical covariance
- On the information-adaptive variants of the ADMM: an iteration complexity perspective
- A multiple testing approach to the regularisation of large sample correlation matrices
- An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation
- Monitoring the covariance matrix with fewer observations than variables
- Group symmetry and covariance regularization
- Sparse permutation invariant covariance estimation
- High dimensional sparse covariance estimation via directed acyclic graphs
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- A dual spectral projected gradient method for log-determinant semidefinite problems
- ROCKET: robust confidence intervals via Kendall's tau for transelliptical graphical models
- Sparse estimation of high-dimensional inverse covariance matrices with explicit eigenvalue constraints
- Simplicial and minimal-variance distances in multivariate data analysis
- Certifiably optimal sparse inverse covariance estimation
- Minimax estimation of large precision matrices with bandable Cholesky factor
- Bayesian inference in nonparanormal graphical models
- Fast and adaptive sparse precision matrix estimation in high dimensions
- Network exploration via the adaptive LASSO and SCAD penalties
- Alternating direction method for covariance selection models
- Regularized estimation of precision matrix for high-dimensional multivariate longitudinal data
- Compressed covariance estimation with automated dimension learning
- Selecting the tuning parameter in penalized Gaussian graphical models
- Do semidefinite relaxations solve sparse PCA up to the information limit?
- A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix
- D-trace estimation of a precision matrix using adaptive lasso penalties
- Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization
- Structural properties of affine sparsity constraints
- Structure estimation for discrete graphical models: generalized covariance matrices and their inverses
- Regularized estimation of large covariance matrices
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Phase recovery, MaxCut and complex semidefinite programming
- Bayesian analysis of nonparanormal graphical models using rank-likelihood
- Estimating sparse precision matrix: optimal rates of convergence and adaptive estimation
- A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression
- Tests for mean vectors in high dimension
- Linear discriminant analysis with a generalization of the Moore-Penrose pseudoinverse
- On how to solve large-scale log-determinant optimization problems
- Regularized parameter estimation in high-dimensional Gaussian mixture models
- Joint estimation of precision matrices in heterogeneous populations
- Adaptive First-Order Methods for General Sparse Inverse Covariance Selection
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- Covariance structure approximation via gLasso in high-dimensional supervised classification
- Identifying small mean-reverting portfolios
- A sparse Ising model with covariates
- Smooth Optimization Approach for Sparse Covariance Selection
- An optimal method for stochastic composite optimization
- Post-regularization inference for time-varying nonparanormal graphical models
- Large-scale sparse inverse covariance matrix estimation
- Probabilistic graphical models and Markov networks
- Estimation of high-dimensional partially-observed discrete Markov random fields
- Positive-definite _1-penalized estimation of large covariance matrices
- Edge selection for undirected graphs
- High-dimensional Gaussian graphical models on network-linked data
- Simultaneous inference for pairwise graphical models with generalized score matching
- Sparse inverse covariance matrix estimation via the _0-norm with Tikhonov regularization
- On the Solution of ℓ0-Constrained Sparse Inverse Covariance Estimation Problems
- Fast algorithms for sparse inverse covariance estimation
- Estimating Multiple Precision Matrices With Cluster Fusion Regularization
- A Greedy Algorithm for Sparse Precision Matrix Approximation
- Precision matrix estimation under data contamination with an application to minimum variance portfolio selection
- scientific article; zbMATH DE number 7307482 (Why is no real title available?)
- FANOK: knockoffs in linear time
- Subsampling algorithms for semidefinite programming
- Graphical model selection for a particular class of continuous-time processes.
- Double shrinkage estimators for large sparse covariance matrices
- Smooth monotone covariance for elliptical distributions and applications in finance
- The matrix pencil nearness problem in structural dynamic model updating
- Fused multiple graphical lasso
- Logarithmic barriers for sparse matrix cones
- An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
- Randomized block proximal damped Newton method for composite self-concordant minimization
- Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
- Estimating structured high-dimensional covariance and precision matrices: optimal rates and adaptive estimation
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Structure learning of exponential family graphical model with false discovery rate control
- Adaptive proximal SGD based on new estimating sequences for sparser ERM
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- Barrier subgradient method
- A block coordinate gradient descent method for regularized convex separable optimization and covariance selection
- Detecting clusters in multivariate response regression
- Convergence analysis of split-Douglas-Rachford algorithm and a novel preconditioned ADMM with an improved condition
- Learning massive-scale partial correlation networks in clinical multiomics studies with HP-ACCORD
- Introduction to correlation networks: interdisciplinary approaches beyond thresholding
- Learning the hub graphical Lasso model with the structured sparsity via an efficient algorithm
- Tight error bounds for log-determinant cones without constraint qualifications
- Comparative study by adding bootstrapping stage in construction of biological networks
- Bayesian scalable precision factor analysis for Gaussian graphical models
- Improved multivariate normal mean estimation with unknown covariance when \(p\) is greater than \(n\)
- A self-calibrated direct approach to precision matrix estimation and linear discriminant analysis in high dimensions
- High-dimensional analysis of semidefinite relaxations for sparse principal components
- Limiting spectral distribution of large-dimensional sample covariance matrices generated by VARMA
- Estimation of covariance matrix via the sparse Cholesky factor with lasso
This page was built for publication: First-Order Methods for Sparse Covariance Selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3609013)
