On convergence of approximate message passing - CEA - Commissariat à l’énergie atomique et aux énergies alternatives Access content directly
Conference Papers Year : 2015

On convergence of approximate message passing


Approximate message passing is an iterative algorithm for compressed sensing and related applications. A solid theory about the performance and convergence of the algorithm exists for measurement matrices having iid entries of zero mean. However, it was observed by several authors that for more general matrices the algorithm often encounters convergence problems. In this paper we identify the reason of the non-convergence for measurement matrices with iid entries and non-zero mean in the context of Bayes optimal inference. Finally we demonstrate numerically that when the iterative update is changed from parallel to sequential the convergence is restored.
Fichier principal
Vignette du fichier
KalKr15.pdf (991.27 Ko) Télécharger le fichier
Origin : Publication funded by an institution

Dates and versions

cea-01223403 , version 1 (05-04-2023)



Francesco Caltagirone, Florent Krzakala, Lenka Zdeborová. On convergence of approximate message passing. ISIT 2014 - 2014 IEEE International Symposium on Information Theory, IEEE, Jun 2014, Honolulu, United States. pp.1812-1816, ⟨10.1109/ISIT.2014.6875146⟩. ⟨cea-01223403⟩
104 View
3 Download



Gmail Facebook Twitter LinkedIn More