“…Originally introduced in the context of compressed sensing as a family of low-complexity iterative algorithms (Donoho et al, 2009), AMP lends it well to a wide spectrum of high-dimensional statistical problems, both as a class of efficient estimation algorithms and as a powerful theoretical machinery. Examples of this kind abound, including robust M-estimators Montanari, 2016, 2015), sparse linear regression (Bayati and Montanari, 2011b;Donoho et al, 2013;Bu et al, 2020;Li and Wei, 2021), generalized linear models Venkataramanan et al, 2021;Barbier et al, 2019), phase retrieval (Ma et al, 2018;Schniter and Rangan, 2014;Aubin et al, 2020), community detection (Deshpande et al, 2017;Ma and Nandy, 2021), structured matrix estimation and principal component analysis (PCA) (Rangan and Fletcher, 2012;Montanari and Venkataramanan, 2021;Deshpande and Montanari, 2014a;Mondelli and Venkataramanan, 2021), mean-field spin glass models (Sellke, 2021;Fan et al, 2022b;Fan and Wu, 2021), to name just a few. The interested reader is referred to Feng et al (2022) for a recent overview of AMP and its wide applicability.…”