PCA Initialization for Approximate Message Passing in Rotationally Invariant Models
Marco Mondelli, Ramji Venkataramanan
Abstract
We study the problem of estimating a rank- signal in the presence of rotationally invariant noise-a class of perturbations more general than Gaussian noise. Principal Component Analysis (PCA) provides a natural estimator, and sharp results on its performance have been obtained in the high-dimensional regime. Recently, an Approximate Message Passing (AMP) algorithm has been proposed as an alternative estimator with the potential to improve the accuracy of PCA. However, the existing analysis of AMP requires an initialization that is both correlated with the signal and independent of the noise, which is often unrealistic in practice. In this work, we combine the two methods, and propose to initialize AMP with PCA. Our main result is a rigorous asymptotic characterization of the performance of this estimator. Both the AMP algorithm and its analysis differ from those previously derived in the Gaussian setting: at every iteration, our AMP algorithm requires a specific term to account for PCA initialization, while in the Gaussian case, PCA initialization affects only the first iteration of AMP. The proof is based on a two-phase artificial AMP that first approximates the PCA estimator and then mimics the true AMP. Our numerical simulations show an excellent agreement between AMP results and theoretical predictions, and suggest an interesting open direction on achieving Bayes-optimal performance.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 091389b9-56da-4f6c-ba3f-a12d30a5c6ccCited by top-tier papers4
- Estimation in Rotationally Invariant Generalized Linear Models via Approximate Message PassingRamji Venkataramanan, Kevin Kögler, Marco MondelliICML 2022 · 36 citations
- The price of ignorance: how much does it cost to forget noise structure in low-rank matrix estimation?Jean Barbier, TianQi Hou, Marco Mondelli, Manuel SáenzNeurIPS 2022 · 25 citations
- Matrix Denoising with Doubly Heteroscedastic Noise: Fundamental Limits and Optimal Spectral MethodsYihan Zhang, Marco MondelliNeurIPS 2024 · 9 citations
- Amodal Instance Segmentation with IRAIS Dataset for Sim-to-Real TransferBidong Chen, Lingui LiICML 2026
Builds on2
- Phase retrieval in high dimensions: Statistical and computational phase transitionsAntoine Maillard, Bruno Loureiro, Florent Krzakala, Lenka ZdeborováNeurIPS 2020 · 73 citations
- All-or-nothing statistical and computational phase transitions in sparse spiked matrix estimationJean Barbier, Nicolas Macris, Cynthia RushNeurIPS 2020 · 42 citations
Related papers
- Optimal Algorithms for the Inhomogeneous Spiked Wigner ModelAleksandr Pak, Justin Ko, Florent KrzakalaNeurIPS 2023 · 17 citations
- Unrolled denoising networks provably learn to perform optimal Bayesian inferenceAayush Karan, Kulin Shah, Sitan Chen, Yonina C. EldarNeurIPS 2024 · 5 citations
- Subspace clustering in high-dimensions: Phase transitions & Statistical-to-Computational gapLuca Pesce, Bruno Loureiro, Florent Krzakala, Lenka ZdeborováNeurIPS 2022 · 4 citations
- Bayes-optimal learning of an extensive-width neural network from quadratically many samplesAntoine Maillard, Emanuele Troiani, Simon Martin, Florent Krzakala et al.NeurIPS 2024 · 26 citations
- Markov Chains Approximate Message PassingAmit Rajaraman, David X. WuSTOC 2026
