Finite Sample Analysis of Approximate Message Passing Algorithms

DOI10.1109/TIT.2018.2816681zbMath1432.62017arXiv1606.01800OpenAlexW3103929211WikidataQ130119872 ScholiaQ130119872MaRDI QIDQ4562320

Cynthia Rush, Ramji Venkataramanan

Publication date: 19 December 2018

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

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

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Inequalities; stochastic orderings (60E15) Statistical aspects of information-theoretic topics (62B10)

Related Items (6)

Algorithmic obstructions in the random number partitioning problem ⋮ Local convexity of the TAP free energy and AMP convergence for \(\mathbb{Z}_2\)-synchronization ⋮ Finite-sample analysis of \(M\)-estimators using self-concordance ⋮ An improved analysis of least squares superposition codes with Bernoulli dictionary ⋮ Optimal combination of linear and spectral estimators for generalized linear models ⋮ A Unifying Tutorial on Approximate Message Passing

This page was built for publication: Finite Sample Analysis of Approximate Message Passing Algorithms