0-1 phase transitions in sparse spiked matrix estimation

Abstract

We consider statistical models of estimation of a rank-one matrix (the spike) corrupted by an additive gaussian noise matrix in the sparse limit. In this limit the underlying hidden vector (that constructs the rank-one matrix) has a number of non-zero components that scales sub-linearly with the total dimension of the vector, and the signal strength tends to infinity at an appropriate speed. We prove explicit low-dimensional variational formulas for the asymptotic mutual information between the spike and the observed noisy matrix in suitable sparse limits. For Bernoulli and Bernoulli-Rademacher distributed vectors, and when the sparsity and signal strength satisfy an appropriate scaling relation, these formulas imply sharp 0-1 phase transitions for the asymptotic minimum mean-square-error. A similar phase transition was analyzed recently in the context of sparse high-dimensional linear regression (compressive sensing).

References in corpus (7)

• Message Passing Algorithms for Compressed Sensing
• The largest eigenvalue of rank one deformation of large Wigner matrices
• Sparse Principal Components Analysis
• Mutual Information in Rank-One Matrix Estimation
• A note on classical ground state energies
• Fundamental limits of low-rank matrix estimation: the non-symmetric case
• Finite Size Corrections and Likelihood Ratio Fluctuations in the Spiked Wigner Model

Cited by in corpus (5)

• Pushing the Limits of Semi-Supervised Learning for Automatic Speech Recognition
• Strong replica symmetry for high-dimensional disordered log-concave Gibbs measures
• The All-or-Nothing Phenomenon in Sparse Tensor PCA
• The Limiting Poisson Law of Massive MIMO Detection with Box Relaxation
• Fundamental limits and algorithms for sparse linear regression with sublinear sparsity