On the Convergence of Approximate Message Passing With Arbitrary Matrices

DOI10.1109/TIT.2019.2913109zbMath1432.94037arXiv1402.3210OpenAlexW2942034734WikidataQ127967826 ScholiaQ127967826MaRDI QIDQ5211372

Philip Schniter, Alyson K. Fletcher, Sundeep Rangan, Subrata Sarkar

Publication date: 28 January 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.3210

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (11)

Fundamental barriers to high-dimensional regression with convex penalties ⋮ Approximate message passing algorithms for rotationally invariant matrices ⋮ A Message-Passing Approach to Phase Retrieval of Sparse Signals ⋮ A tradeoff between false discovery and true positive proportions for sparse high-dimensional logistic regression ⋮ Asymptotic risk and phase transition of \(l_1\)-penalized robust estimator ⋮ Compressive Computed Tomography Reconstruction through Denoising Approximate Message Passing ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Denoising AMP for MRI Reconstruction: BM3D-AMP-MRI ⋮ A Unifying Tutorial on Approximate Message Passing ⋮ Replica analysis of overfitting in generalized linear regression models

This page was built for publication: On the Convergence of Approximate Message Passing With Arbitrary Matrices