mlsanityData to 7 Oct 2026

Approximate Message Passing with Spectral Initialization for Generalized Linear Models

arXiv 2010.03460 ↗First posted 7 Oct 2020stat.ML cs.IT cs.LGcited by 22

Not on the map. Why?

Abstract (arXiv)

We consider the problem of estimating a signal from measurements obtained via a generalized linear model. We focus on estimators based on approximate message passing (AMP), a family of iterative algorithms with many appealing features: the performance of AMP in the high-dimensional limit can be succinctly characterized under suitable model assumptions; AMP can also be tailored to the empirical distribution of the signal entries, and for a wide class of estimation problems, AMP is conjectured to be optimal among all polynomial-time algorithms. However, a major issue of AMP is that in many models (such as phase retrieval), it requires an initialization correlated with the ground-truth signal and independent from the measurement matrix. Assuming that such an initialization is available is typically not realistic. In this paper, we solve this problem by proposing an AMP algorithm initialized with a spectral estimator. With such an initialization, the standard AMP analysis fails since the spectral estimator depends in a complicated way on the design matrix. Our main contribution is a rigorous characterization of the performance of AMP with spectral initialization in the high-dimensional limit. The key technical idea is to define and analyze a two-phase artificial AMP algorithm that first produces the spectral estimator, and then closely approximates the iterates of the true AMP. We also provide numerical results that demonstrate the validity of the proposed approach.

Key facts. Cited by 22 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Oct 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 2; 2023: 5; 2024: 6; 2025: 5; 2026: 1.

22 papers.

Sort:

By area:

  1. 2021Estimation in Rotationally Invariant Generalized Linear Models via Approximate Message Passingcited by 18
  2. 2024Fundamental computational limits of weak learnability in high-dimensional multi-index modelscited by 17
  3. 2021PCA Initialization for Approximate Message Passing in Rotationally Invariant Modelscited by 14
  4. 2022The price of ignorance: how much does it cost to forget noise structure in low-rank matrix estimation?cited by 9
  5. 2023Optimal Algorithms for the Inhomogeneous Spiked Wigner Modelcited by 8
  6. 2023Approximate Message Passing for the Matrix Tensor Product Modelcited by 6
  7. 2025Spectral Estimators for Multi-Index Models: Precise Asymptotics and Optimal Weak Recoverycited by 6
  8. 2025Optimal Spectral Transitions in High-Dimensional Multi-Index Modelscited by 6
  9. 2023Spectral Estimators for Structured Generalized Linear Models via Approximate Message Passingcited by 5
  10. 2024Compression of Structured Data with Autoencoders: Provable Benefit of Nonlinearities and Depthcited by 4
  11. 2024Spectral Phase Transition and Optimal PCA in Block-Structured Spiked modelscited by 4
  12. 2022Bayes-optimal limits in structured PCA, and how to reach themcited by 3
10 more
  1. 2023Mixed Regression via Approximate Message Passingcited by 3
  2. 2024Fundamental limits of Non-Linear Low-Rank Matrix Estimationcited by 2
  3. 2024Fast and Robust Phase Retrieval via Deep Expectation-Consistent Approximationcited by 2
  4. 2025Optimal and Provable Calibration in High-Dimensional Binary Classification: Angular Calibration and Platt Scalingcited by 2
  5. 2025Orthogonal Approximate Message Passing with Optimal Spectral Initializations for Rectangular Spiked Matrix Modelscited by 1
  6. 2021Towards Designing Optimal Sensing Matrices for Generalized Linear Inverse Problemscited by 0
  7. 2023Mismatched estimation of non-symmetric rank-one matrices corrupted by structured noisecited by 0
  8. 2024Inferring Change Points in High-Dimensional Regression via Approximate Message Passingcited by 0
  9. 2025Self-Boost via Optimal Retraining: An Analysis via Approximate Message Passingcited by 0
  10. 2026DAIF: A Data-Driven Intermediate Fusion Framework for Multimodal Supervised Learning via Approximate Message Passingcited by 0