$\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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

$\ell_{0}$ Penalized Maximum Likelihood Estimation of Sparse Covariance Matrices

Petre Stoica, Prabhu Babu, Ghania Fatima
1 citations
IEEE Signal Processing Letters
Blind Source Separation Techniques
0.35
article

$\ell_{0}$ Penalized Maximum Likelihood Estimation of Sparse Covariance Matrices

Petre Stoica, Prabhu Babu, Ghania Fatima
article en
1 citations

Abstract

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.

IEEE Signal Processing LettersVol. 32
Uppsala University (SE), Indian Institute of Technology Delhi (IN)
Openalex Percentile: Top 42%
Blind Source Separation Techniques
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.