Fetching the paper…
Reading the bibliography…
Approximate message passing (AMP) methods and their variants have attracted considerable recent attention for the problem of estimating a random vector $\mathbf{x}$ observed through a linear transform $\mathbf{A}$.
K. J. Arrow, L. Hurwicz, and H. Uzawa,
1958
Earlier work this paper cites.
V. A. Marčenko and L. A. Pastur, “Distribution of eigenvalues for some sets of random matrices,”
1967
Earlier work this paper cites.
M. Vidyasagar,
1978
Earlier work this paper cites.
R. D. Yates, “A framework for uplink power control in cellular radio systems,”
1995
Earlier work this paper cites.
A. Chambolle, R. A. DeVore, N. Y. Lee, and B. J. Lucier, “Nonlinear wavelet image processing: Variational problems, compression, and noise removal through wavelet shrinkage,”
1998
Earlier work this paper cites.
Y. Weiss and W. T. Freeman, “Correctness of belief propagation in Gaussian graphical models of arbitrary topology,” in
2000
Earlier work this paper cites.
P. Rusmevichientong and B. Van Roy, “An analysis of belief propagation on the turbo decoding graph with Gaussian densities,”
2001
Earlier work this paper cites.
J. S. Yedidia, W. T. Freeman, and Y. Weiss, “Understanding belief propagation and its generalizations,” in
2003
Earlier work this paper cites.
I. Daubechies, M. Defrise, and C. D. Mol, “An iterative thresholding algorithm for linear inverse problems with a sparsity constraint,”
2004
Earlier work this paper cites.
M. Pretti, “A message-passing algorithm with damping,”
2005
Earlier work this paper cites.
P. L. Combettes and V. R. Wajs, “Signal recovery by proximal forward-backward splitting,”
2005
Earlier work this paper cites.
V. Kolmogorov, “Convergent tree-reweighted message passing for energy minimization,”
2006
Earlier work this paper cites.
D. M. Malioutov, J. K. Johnson, and A. S. Willsky, “Walk-sums and belief propagation in Gaussian graphical models,”
2006
Earlier work this paper cites.
D. M. Malioutov, J. K. Johnson, and A. S. Willsky, “Walk-sums and belief propagation in Gaussian graphical models,”
2006
Earlier work this paper cites.
Y. E. Nesterov, “Gradient methods for minimizing composite objective function,” center for Operations Research and Econometrics (CORE), Catholic Univ. Louvain, Louvain-la-Neuve, Belgium, CORE Discussion Paper 2007/76, 2007
2007
Earlier work this paper cites.
J. Bioucas-Dias and M. Figueiredo, “A new TwIST: Two-step iterative shrinkage/thresholding algorithms for image restoration,”
2007
Earlier work this paper cites.
A. Globerson and T. S. Jaakkola, “Fixing max-product: Convergent message passing algorithms for map lp-relaxations,” in
2007
Cited alongside, same era.
D. Bickson, “Gaussian belief propagation: Theory and application,”
2008
Cited alongside, same era.
S. J. Wright, R. D. Nowak, and M. Figueiredo, “Sparse reconstruction by separable approximation,”
2009
Cited alongside, same era.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problem,”
2009
Cited alongside, same era.
D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,”
2009
Cited alongside, same era.
P. Schniter and S. Rangan, “Compressive phase retrieval via generalized approximate message passing,” in
2012
Later among the works it cites.
A. Javanmard and A. Montanari, “State evolution for general approximate message passing algorithms, with applications to spatial coupling,”
2013
Later among the works it cites.
S. Rangan, P. Schniter, E. Riegler, A. Fletcher, and V. Cevher, “Fixed points of generalized approximate message passing with arbitrary matrices,” in
2013
Later among the works it cites.
2013
Later among the works it cites.
S. Rangan, P. Schniter, and A. K. Fletcher, “On the convergence of approximate message passing with arbitrary matrices,” in
2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2009
Cited alongside, same era.
C. C. Moallemi and B. Van Roy, “Convergence of min-sum message passing for quadratic optimization,”
2009
Cited alongside, same era.
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,”
2010
Cited alongside, same era.
E. Esser, X. Zhang, and T. F. Chan, “A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science,”
2010
Cited alongside, same era.
——, “Message passing algorithms for compressed sensing I: Motivation and construction,” in
2010
Cited alongside, same era.
2010
Cited alongside, same era.
C. C. Moallemi and B. Van Roy, “Convergence of min-sum message-passing for convex optimization,”
2010
Cited alongside, same era.
F. Krzakala, A. Manoel, E. W. Tramel, and L. Zdeborová, “Variational free energies for compressed sensing,” in
2014
Closest in time.
F. Caltagirone, L. Zdeborová, and F. Krzakala, “On convergence of approximate message passing,” in
2014
Closest in time.
N. Komodakis and J.-C. Pesquet, “Playing with duality: An overview of recent primal-dual approaches for solving large-scale optimization problems,”
2015
Closest in time.
M. Bayati, M. Lelarge, and A. Montanari, “Universality in polytope phase transitions and message passing algorithms,”
2015
Closest in time.
A. Manoel, F. Krzakala, E. W. Tramel, and L. Zdeborová, “Swept approximate message passing for sparse estimation,” in
2015
Closest in time.
S. Rangan, A. K. Fletcher, P. Schniter, and U. S. Kamilov, “Inference for generalized linear models via alternating directions and Bethe free energy minimization,” in
2015
Closest in time.
C. Rush and R. Venkataramanan, “Finite-sample analysis of approximate message passing,” in
2016
Closest in time.
S. Rangan, P. Schniter, and A. K. Fletcher, “Vector approximate message passing,” in
2017
Closest in time.
A. K. Fletcher and P. Schniter, “Learning and free energies for vector approximate message passing,” in
2017
Closest in time.
J. Vila, P. Schniter, S. Rangan, F. Krzakala, and L. Zdeborová, “Adaptive damping and mean removal for the generalized approximate message passing algorithm,” in
2025
Closest in time.