A Sample-Deficient Analysis of the Leading Generalized Eigenvalue for the Detection of Signals in Colored Gaussian Noise
This paper investigates the signal detection problem in colored Gaussian noise with an unknown covariance matrix. To be specific, we consider a sample deficient scenario in which the number of signal bearing samples ($n$) is strictly smaller than the dimensionality of the signal space ($m$). Our test statistic is the leading generalized eigenvalue of the whitened sample covariance matrix (a.k.a. $F$-matrix) which is constructed by whitening the signal bearing sample covariance matrix with noise-only sample covariance matrix. The whitening operation along with the observation model induces a single spiked covariance structure on the $F$-matrix. Moreover, the sample deficiency (i.e., $m>n$) in turn makes this $F$-matrix rank deficient, thereby {\it singular}. Therefore, a simple exact statistical characterization of the leading generalized eigenvalue (l.g.e.) of a complex correlated {\it singular} $F$-matrix with a single spiked associated covariance is of paramount importance to assess the performance of the detector (i.e., the receiver operating characteristics (ROC)). To this end, we adopt the powerful orthogonal polynomial technique in random matrix theory to derive a new finite dimensional c.d.f. expression for the l.g.e. of this particular $F$-matrix. It turns out that when the noise only sample covariance matrix is nearly rank deficient and the signal-to-noise ratio is $O(m)$, the ROC profile converges to a remarkably simple limiting profile.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Stability and Bifurcation Analysis of Nonlinear PDEs via Random Projection-based PINNs: A Krylov-Arnoldi Approach
We address a numerical framework for the stability and bifurcation analysis of nonlinear partial differential equations (PDEs) in which the solution is sought in the function space spanned by physics-informed random proj…
Eigenvalue and Generalized Eigenvalue Problems: Tutorial
This paper is a tutorial for eigenvalue and generalized eigenvalue problems. We first introduce eigenvalue problem, eigen-decomposition (spectral decomposition), and generalized eigenvalue problem. Then, we mention the o…
BIG-bench Machine LearningMatrix Factorization / DecompositionAn Inverse-free Truncated Rayleigh-Ritz Method for Sparse Generalized Eigenvalue Problem
This paper considers the sparse generalized eigenvalue problem (SGEP), which aims to find the leading eigenvector with at most $k$ nonzero entries. SGEP naturally arises in many applications in machine learning, statisti…
A Note on Sparse Generalized Eigenvalue Problem
The sparse generalized eigenvalue problem (SGEP) aims to find the leading eigenvector with sparsity structure. SGEP plays an important role in statistical learning and has wide applications including, but not limited to,…
Generalized Eigenvalue Problems with Generative Priors
Generalized eigenvalue problems (GEPs) find applications in various fields of science and engineering. For example, principal component analysis, Fisher's discriminant analysis, and canonical correlation analysis are spe…