Information-Theoretic Limits for Rectangular Spiked Matrix Models with Rotationally Invariant Noise
Qun Chen, Rudy Skerk, Jean Barbier, Francesco Camilli, Junjie Ma, Haochuan Zhang
Abstract
We study the information-theoretic limits of inference in rectangular rank-one spiked matrix models with additive rotationally invariant noise, thereby going beyond the standard assumption of independent noise entries. Using the replica method from statistical physics, we derive a variational formula for the mutual information between the signal and the data, together with a system of saddle point equations predicting the minimum mean squared error in estimating the rank-one spike. We further show that, in the Bayes-optimal setting, these saddle point equations coincide with the fixed point equations of the state evolution of a recently proposed orthogonal approximate message passing algorithm with Bayes-optimal denoisers. This equivalence provides an algorithmic interpretation of the replica prediction and supports the Bayes-optimality of orthogonal approximate message passing whenever the relevant fixed point is unique. Numerical evaluations of the saddle point equations for several rotationally invariant noise ensembles and signal priors, together with finite-size simulations of the algorithm, confirm the asymptotic predictions. They illustrate both regimes with a unique informative fixed point, where orthogonal approximate message passing is predicted to attain the minimum mean squared error, and regimes with multiple fixed points, where a statistical-to-computational gap exists.
Create a lesson
Related papers
On the Multi-Weight Shift-Sum Iterative Decoding of Short BCH Codes
Yinglei Yang, Di Zhang, Aimin Li et al.
Digital-Twin-Referenced Belief-Guided Q-Learning for Jammer Identification and Beam-Power Control in a mmWave Model
Parmida Geranmayeh, Onur Günlü
Universal Distributed Feature Extraction Complementary to Side Information via H-Score
Yuan Xinjie, Dier Tang, Shaolun-Huang
On Measures of Dissimilarity on the Majorization Simplex
Tarun Hariharan, Prasad Krishnan, Abhishek Deshpande
Covering Radius and Deep Holes of Hyperderivative Reed-Solomon Codes under the NRT Metric
Zhihao Zhu, Haojie Gu, Jun Zhang et al.
Multiple-Function Approximated Coded Computing: Constructions and Error Bounds
Rimpi Borah, Wilton Kim, J. Harshan et al.