Group Lasso Estimation of High-Dimensional Covariance Matrices

Abstract

In this paper, we consider the Group Lasso estimator of the covariance matrix of a stochastic process corrupted by an additive noise. We propose to estimate the covariance matrix in a high-dimensional setting under the assumption that the process has a sparse representation in a large dictionary of basis functions. Using a matrix regression model, we propose a new methodology for high-dimensional covariance matrix estimation based on empirical contrast regularization by a group Lasso penalty. Using such a penalty, the method selects a sparse set of basis functions in the dictionary used to approximate the process, leading to an approximation of the covariance matrix into a low dimensional space. Consistency of the estimator is studied in Frobenius and operator norms and an application to sparse PCA is proposed.

Cite

Text

Bigot et al. "Group Lasso Estimation of High-Dimensional Covariance Matrices." Journal of Machine Learning Research, 2011.

Markdown

[Bigot et al. "Group Lasso Estimation of High-Dimensional Covariance Matrices." Journal of Machine Learning Research, 2011.](https://mlanthology.org/jmlr/2011/bigot2011jmlr-group/)

BibTeX

@article{bigot2011jmlr-group,
  title     = {{Group Lasso Estimation of High-Dimensional Covariance Matrices}},
  author    = {Bigot, Jérémie and Biscay, Rolando J. and Loubes, Jean-Michel and Muñiz-Alvarez, Lillian},
  journal   = {Journal of Machine Learning Research},
  year      = {2011},
  pages     = {3187-3225},
  volume    = {12},
  url       = {https://mlanthology.org/jmlr/2011/bigot2011jmlr-group/}
}