Smooth Optimization Approach for Sparse Covariance Selection
From MaRDI portal
Abstract: In this paper we first study a smooth optimization approach for solving a class of nonsmooth strictly concave maximization problems whose objective functions admit smooth convex minimization reformulations. In particular, we apply Nesterov's smooth optimization technique [Y.E. Nesterov, Dokl. Akad. Nauk SSSR, 269 (1983), pp. 543--547; Y. E. Nesterov, Math. Programming, 103 (2005), pp. 127--152] to their dual counterparts that are smooth convex problems. It is shown that the resulting approach has iteration complexity for finding an -optimal solution to both primal and dual problems. We then discuss the application of this approach to sparse covariance selection that is approximately solved as an -norm penalized maximum likelihood estimation problem, and also propose a variant of this approach which has substantially outperformed the latter one in our computational experiments. We finally compare the performance of these approaches with other first-order methods, namely, Nesterov's smooth approximation scheme and block-coordinate descent method studied in [A. d'Aspremont, O. Banerjee, and L. El Ghaoui, SIAM J. Matrix Anal. Appl., 30 (2008), pp. 56--66; J. Friedman, T. Hastie, and R. Tibshirani, Biostatistics, 9 (2008), pp. 432--441] for sparse covariance selection on a set of randomly generated instances. It shows that our smooth optimization approach substantially outperforms the first method above, and moreover, its variant substantially outperforms both methods above.
Recommendations
- First-Order Methods for Sparse Covariance Selection
- A block coordinate gradient descent method for regularized convex separable optimization and covariance selection
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- Adaptive First-Order Methods for General Sparse Inverse Covariance Selection
- A DC programming approach for sparse estimation of a covariance matrix
Cited in
(24)- An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation
- Nearly optimal first-order methods for convex optimization under gradient norm measure: an adaptive regularization approach
- Sparse estimation of high-dimensional inverse covariance matrices with explicit eigenvalue constraints
- Bayesian inference in nonparanormal graphical models
- Alternating direction method for covariance selection models
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Bayesian analysis of nonparanormal graphical models using rank-likelihood
- On how to solve large-scale log-determinant optimization problems
- Adaptive First-Order Methods for General Sparse Inverse Covariance Selection
- An optimal method for stochastic composite optimization
- scientific article; zbMATH DE number 6982922 (Why is no real title available?)
- On ${l}_{q}$ Optimization and Sparse Inverse Covariance Selection
- A partial graphical model with a structural prior on the direct links between predictors and responses
- scientific article; zbMATH DE number 7307482 (Why is no real title available?)
- The matrix pencil nearness problem in structural dynamic model updating
- Fused multiple graphical lasso
- An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
- Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
- Adaptive proximal SGD based on new estimating sequences for sparser ERM
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- A block coordinate gradient descent method for regularized convex separable optimization and covariance selection
- Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression
- Convergence analysis of split-Douglas-Rachford algorithm and a novel preconditioned ADMM with an improved condition
- Learning the hub graphical Lasso model with the structured sparsity via an efficient algorithm
This page was built for publication: Smooth Optimization Approach for Sparse Covariance Selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648531)
