Orthogonal Approximate Message Passing Algorithms for Rectangular Spiked Matrix Models with Rotationally Invariant Noise
Haohua Chen, Songbin Liu, Junjie Ma
TL;DR
This work extends orthogonal AMP to rectangular spiked matrix models with rotationally invariant noise by deriving a rigorous state evolution that exactly tracks high-dimensional dynamics. It introduces an optimal OAMP variant with MMSE-based denoisers and a spectral pre-processing framework that leverages the noise spectrum, showing that in the Gaussian RI case the fixed point aligns with AMP and conjecturing Bayes-optimal performance in broader RI settings. Theoretical SE results are complemented by simulations under IID Gaussian and non-Gaussian RI noise, which validate the predictions and demonstrate superior performance over PCA and RI-AMP baselines. Overall, the paper provides a principled, spectrally informed approach to achieving near-optimal signal recovery in high-dimensional, RI-noise environments with rectangular data geometry.
Abstract
We propose an orthogonal approximate message passing (OAMP) algorithm for signal estimation in the rectangular spiked matrix model with general rotationally invariant (RI) noise. We establish a rigorous state evolution that exactly characterizes the high-dimensional dynamics of the algorithm. Building on this framework, we derive an optimal variant of OAMP that minimizes the predicted mean-squared error at each iteration. For the special case of i.i.d. Gaussian noise, the fixed point of the proposed OAMP algorithm coincides with that of the standard AMP algorithm. For general RI noise models, we conjecture that the optimal OAMP algorithm is statistically optimal within a broad class of iterative methods, and achieves Bayes-optimal performance in certain regimes.
