$\ell_{0}$ Penalized Maximum Likelihood Estimation of Sparse Covariance Matrices
In this letter we present a framework for estimating sparse covariance matrices, wherein we solve the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\ell _{0}-$</tex-math></inline-formula>norm penalized maximum likelihood estimation problem using the extended Bayesian information criterion (EBIC), a high dimensional model selection rule. The framework combines choosing the sparsity pattern and estimating the covariance matrix in a single step, eliminating the need for any hyper-parameter tuning. Using the framework we propose a cyclic majorization-minimization based technique and apply it to synthetic data to evaluate its performance in terms of normalized root mean square error (NRMSE) and Kullback Leibler (KL) divergence.
Authors
- Petre Stoica (ORCID: https://orcid.org/0000-0002-7957-3711)
- Prabhu Babu (ORCID: https://orcid.org/0000-0002-9041-9010)
- Ghania Fatima (ORCID: https://orcid.org/0000-0001-8268-0545)
Institutions
- Uppsala University (SE)
- Indian Institute of Technology Delhi (IN)
Publication Details
- Journal
- IEEE Signal Processing Letters
- Published
- 2024-11-11
- DOI
- https://doi.org/10.1109/lsp.2024.3495576
- Citations
- 1
- Primary Topic
- Blind Source Separation Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.35