Generalized approximate survey propagation for high-dimensional estimation * *This article is an updated version of: Lucibello C, Saglietti L and Lu Y 2019 Generalized approximate survey propagation for high-dimensional estimation Proc. 36th Int. Conf. on Machine Learning pp 4173--82

Abstract

In generalized linear estimation (GLE) problems, we seek to estimate a signal that is observed through a linear transform followed by a component-wise, possibly nonlinear and noisy, channel. In the Bayesian optimal setting, generalized approximate message passing (GAMP) is known to achieve optimal performance for GLE. However, its performance can significantly degrade whenever there is a mismatch between the assumed and the true generative model, a situation frequently encountered in practice. In this paper, we propose a new algorithm, named generalized approximate survey propagation (GASP), for solving GLE in the presence of prior or model mis-specifications. As a prototypical example, we consider the phase retrieval problem, where we show that GASP outperforms the corresponding GAMP, reducing the reconstruction threshold and, for certain choices of its parameters, approaching Bayesian optimal performance. Furthermore, we present a set of state evolution equations that exactly characterize the dynamics of GASP in the high-dimensional limit.