Fetching the paper…
Reading the bibliography…
The standard linear regression (SLR) problem is to recover a vector $\mathbf{x}^0$ from noisy linear observations $\mathbf{y}=\mathbf{Ax}^0+\mathbf{w}$.
D. J. Thouless, P. W. Anderson, and R. G. Palmer, “Solution of ‘solvable model of a spin glass’,” Phil. Mag. , vol. 35, pp. 983–990, 1977
1977
Earlier work this paper cites.
J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference . San Mateo, CA: Morgan Kaufmann Publ., 1988
1988
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,” IEEE Trans. Image Process. , vol. 7, no. 3, pp. 319–335, Mar. 1998
1998
Earlier work this paper cites.
M. Opper and O. Winther, “Adaptive and self-averaging Thouless-Anderson-Palmer mean-field theory for probabilistic modeling,” Physical Review E , vol. 64, no. 5, p. 056131, 2001
2001
Earlier work this paper cites.
T. P. Minka, “A family of algorithms for approximate Bayesian inference,” Ph.D. dissertation, Dept. Comp. Sci. Eng., MIT, Cambridge, MA, 2001
2001
Earlier work this paper cites.
H. J. Brascamp and E. H. Lieb, “On extensions of the Brunn-Minkowski and Prékopa-leindler theorems, including inequalities for log concave functions, and with an application to the diffusion equation,” in Inequalities . Berlin: Springer, 2002, pp. 441–464
2002
Earlier work this paper cites.
J. S. Yedidia, W. T. Freeman, and Y. Weiss, “Understanding belief propagation and its generalizations,” in Exploring Artificial Intelligence in the New Millennium . San Francisco, CA: Morgan Kaufmann Publishers, 2003, pp. 239–269
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,” Commun. Pure Appl. Math. , vol. 57, no. 11, pp. 1413–1457, Nov. 2004
2004
Earlier work this paper cites.
A. Tulino and S. Verdú, “Random matrix theory and wireless communications,” Found. Trends Commun. Info. Thy. , vol. 1, pp. 1–182, 2004
2004
Earlier work this paper cites.
M. Seeger, “Expectation propagation for exponential families,” EPFL-REPORT-161464 , 2005
2005
Earlier work this paper cites.
M. Opper and O. Winther, “Expectation consistent approximate inference,” J. Mach. Learning Res. , vol. 1, pp. 2177–2204, 2005
2005
Earlier work this paper cites.
D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” Proc. Nat. Acad. Sci. , vol. 106, no. 45, pp. 18 914–18 919, Nov. 2009
2009
Earlier work this paper cites.
——, “Message passing algorithms for compressed sensing I: Motivation and construction,” in Proc. Info. Theory Workshop , Jan. 2010, pp. 1–5
2010
Earlier work this paper cites.
M. Bayati and A. Montanari, “The dynamics of message passing on dense graphs, with applications to compressed sensing,” IEEE Trans. Inform. Theory , vol. 57, no. 2, pp. 764–785, Feb. 2011
2011
Cited alongside, same era.
N. Halko, P. G. Martinsson, and J. A. Tropp, “Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions,” SIAM Rev. , vol. 53, no. 2, pp. 217–288, 2011
2011
Cited alongside, same era.
S. Rangan, “Generalized approximate message passing for estimation with random linear mixing,” in Proc. IEEE ISIT , 2011, pp. 2174–2178
2011
Cited alongside, same era.
A. Montanari, “Graphical model concepts in compressed sensing,” in Compressed Sensing: Theory and Applications , Y. C. Eldar and G. Kutyniok, Eds. Cambridge Univ. Press, Jun. 2012, pp. 394–438
2012
Cited alongside, same era.
A. Manoel, F. Krzakala, E. W. Tramel, and L. Zdeborová, “Swept approximate message passing for sparse estimation,” in Proc. ICML , 2015, pp. 1123–1132
2015
Later among the works it cites.
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 Proc. IEEE ISIT , 2015, pp. 1640–1644
2015
Later among the works it cites.
——, “S-AMP for non-linear observation models,” in Proc. IEEE ISIT , 2015, pp. 2807–2811
2015
Later among the works it cites.
M. Pereyra, P. Schniter, E. Chouzenoux, J.-C. Pesquet, J.-Y. Tourneret, A. Hero, and S. McLaughlin, “A survey of stochastic simulation and optimization methods in signal processing,” IEEE J. Sel. Topics Signal Process. , vol. 10, pp. 1–14, 2016
2016
Closest in time.
C. Rush and R. Venkataramanan, “Finite-sample analysis of approximate message passing,” in Proc. IEEE ISIT , 2016, pp. 755–759
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. M. Tulino, G. Caire, S. Verdú, and S. Shamai, “Support recovery with sparsely sampled free random matrices,” IEEE Trans. Inform. Theory , vol. 59, no. 7, pp. 4243–4271, 2013
2013
Cited alongside, same era.
S. Rangan, P. Schniter, E. Riegler, A. Fletcher, and V. Cevher, “Fixed points of generalized approximate message passing with arbitrary matrices,” in Proc. IEEE ISIT , Jul. 2013, pp. 664–668
2013
Cited alongside, same era.
S. Rangan, P. Schniter, and A. K. Fletcher, “On the convergence of approximate message passing with arbitrary matrices,” in Proc. IEEE ISIT , Jul. 2014, pp. 236–240
2014
Cited alongside, same era.
F. Caltagirone, L. Zdeborová, and F. Krzakala, “On convergence of approximate message passing,” in Proc. IEEE ISIT , Jul. 2014, pp. 1812–1816
2014
Cited alongside, same era.
Y. Kabashima and M. Vehkaperä, “Signal recovery using expectation consistent approximation for linear observations,” in Proc. IEEE ISIT , 2014, pp. 226–230
2014
Cited alongside, same era.
B. Çakmak, O. Winther, and B. H. Fleury, “S-AMP: Approximate message passing for general matrix ensembles,” in Proc. IEEE Information Theory Workshop (ITW) , 2014, pp. 192–196
2014
Cited alongside, same era.
F. Krzakala, A. Manoel, E. W. Tramel, and L. Zdeborová, “Variational free energies for compressed sensing,” in Proc. IEEE ISIT , Jul. 2014, pp. 1499–1503
2014
Cited alongside, same era.
M. Bayati, M. Lelarge, and A. Montanari, “Universality in polytope phase transitions and message passing algorithms,” Ann. Appl. Prob. , vol. 25, no. 2, pp. 753–822, 2015
2015
Cited alongside, same era.
2016
Closest in time.
A. K. Fletcher, M. Sahraee-Ardakan, S. Rangan, and P. Schniter, “Expectation consistent approximate inference: Generalizations and convergence,” in Proc. IEEE ISIT , 2016, pp. 190–194
2016
Closest in time.
J. Ma and L. Ping, “Orthogonal AMP,” arXiv:1602.06509 , 2016
2016
Closest in time.
2016
Closest in time.
G. Reeves and H. D. Pfister, “The replica-symmetric prediction for compressed sensing with Gaussian matrices is exact,” in Proc. IEEE ISIT , 2016
2016
Closest in time.
2016
Closest in time.
K. Takeuchi, “Rigorous dynamics of expectation-propagation-based signal recovery from unitarily invariant measurements,” in Proc. ISIT , 2017, pp. 501–505
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 Proc. IEEE ICASSP , 2015, pp. 2021–2025
2025
Closest in time.