Fetching the paper…
Reading the bibliography…
We introduce a theoretical approach for designing generalizations of the approximate message passing (AMP) algorithm for compressed sensing which are valid for large observation matrices that are drawn from an invariant random matrix ensemble.
P. C. Martin, E. D. Siggia, and H. A. Rose, “Statistical dynamics of classical systems,” Physical Review A , vol. 8.1, p. 423, 1973
1973
Earlier work this paper cites.
J. R. L. De Almeida and D. J. Thouless, “Stability of the Sherrington-Kirkpatrick solution of a spin glass model,” Journal of Physics A: Mathematical and General , vol. 11, no. 5, p. 983, 1978
1978
Earlier work this paper cites.
M. Mézard, G. Parisi, and M. Virasoro, Spin Glass Theory and Beyond . World Scientific, 1987, vol. 9
1987
Earlier work this paper cites.
H. Eisfeller and M. Opper, “New method for studying the dynamics of disordered spin systems without finite-size effects,” Physical Review Letters , vol. 68, p. 2094, 1992
1992
Earlier work this paper cites.
E. Marinari, G. Parisi, and F. Ritort, “Replica field theory for deterministic models. ii. a non-random spin glass with glassy behaviour,” Journal of Physics A: Mathematical and General , vol. 27.23, p. 7647, 1994
1994
Earlier work this paper cites.
L. F. Cugliandolo and J. Kurchan, “On the out-of-equilibrium relaxation of the Sherrington-Kirkpatrick model,” Journal of Physics A: Mathematical and General , vol. 27.17, p. 5749, 1994
1994
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, pp. 056 131–(1–14), October 2001
2001
Earlier work this paper cites.
A. M. Tulino and S. Verdú, Random Matrix Theory and Wireless Communications . Now Publishers Inc., June 2004, vol. 1, no. 1
2004
Earlier work this paper cites.
——, “Expectation consistent approximate inference,” Journal of Machine Learning Research , 6 (2005): 2177-2204
2005
Earlier work this paper cites.
B. Collins and P. Śniady, “New scaling of Itzykson–Zuber integrals,” Annales de l’Institut Henri Poincare (B) Probability and Statistics , vol. 43, no. 2, pp. 139 – 146, 2007
2007
Cited alongside, same era.
D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” Proceedings of the National Academy of Sciences , vol. 106, no. 45, pp. 18 914–18 919, September 2009
2009
Cited alongside, same era.
P. Deift and D. Gioev, Random Matrix Theory: Invariant Ensembles and Universality . American Mathematical Society, 2009, vol. 18
2009
Cited alongside, same era.
N. Merhav, Statistical Physics and Information Theory . Foundations and Trends in Communications and Information Theory, 2010, vol. 6, no. 1–2
2010
Cited alongside, same era.
M. Bayati and A. Montanari, “The dynamics of message passing on dense graphs, with applications to compressed sensing,” IEEE Transactions on Information Theory , vol. 57, no. 2, pp. 764–785, February 2011
K. Mimura and M. Okada, “Generating functional analysis for iterative CDMA multiuser detectors,” IEEE Transactions on Information Theory , vol. 60, no. 6, pp. 3645–3670, June 2014
2014
Later among the works it cites.
M. Bayati, M. Lelarge, and A. Montanari, “Universality in polytope phase transitions and message passing algorithms,” The Annals of Applied Probability , vol. 25, no. 2, pp. 753–822, April 2015
2015
Later among the works it cites.
J. Barbier, M. Dia, N. Macris, and F. Krzakala, “The mutual information in random linear estimation,” arXiv preprint arXiv: 1607.02335 , September 2016
2016
Later among the works it cites.
M. Vehkaperä, Y. Kabashima, and S. Chatterjee, “Analysis of regularized ls reconstruction and random matrix ensembles in compressed sensing,” IEEE Transactions on Information Theory , vol. 62, no. 4, pp. 2100–2124, April 2016
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
A. M. Tulino, G. Caire, S. Shamai, and S. Verdú, “Support recovery with sparsely sampled free random matrices,” IEEE Transactions on Information Theory , vol. 59, pp. 4243–4271, July 2013
2013
Cited alongside, same era.
G. W. Anderson and B. Farrell, “Asymptotically liberating sequences of random unitary matrices,” Advances in Mathematics , vol. 255, pp. 381 – 413, 2014
2014
Cited alongside, same era.
Y. Kabashima and M. Vehkaperä, “Signal recovery using expectation consistent approximation for linear observations,” in 2014 IEEE International Symposium on Information Theory , June 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) , November 2014
2014
Cited alongside, same era.
A. Bereyhi, R. R. Müller, and H. Schulz-Baldes, “Statistical mechanics of MAP estimation: General replica ansatz,” arXiv preprint arXiv: 1612.01980 , December 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
M. Opper, B. Çakmak, and O. Winther, “A theory of solving TAP equations for Ising models with general invariant random matrices,” Journal of Physics A: Mathematical and Theoretical , vol. 49, no. 11, p. 114002, 2016
2016
Later among the works it cites.
S. Rangan, P. Schniter, and A. Fletcher, “Vector approximate message passing,” arXiv preprint arXiv: 1610.03082 , October 2016
2016
Later among the works it cites.