Fetching the paper…
Reading the bibliography…
We investigate the problem of approximate Bayesian inference for a general class of observation models by means of the expectation propagation (EP) framework for large systems under some statistical assumptions.
D. Sherrington and S. Kirkpatrick, “Solvable model of a spin-glass,” Physical Review Letters , vol. 35.26, p. 1792, 1975
1975
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.
A. J. Bray and M. A. Moore, “Metastable states, internal field distributions and magnetic excitations in spin glasses,” Journal of Physics C: Solid State Physics , vol. 14, p. 2629, 1981
1981
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.
D. V. Voiculescu, K. J. Dykema, and A. Nica, Free random variables . American Mathematical Society, 1992, vol. 1
1992
Earlier work this paper cites.
K. H. Fisher and J. A. Hertz, Eds., Spin Glasses . Cambridge University Press, 1993, vol. 1
1993
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, October 1994
1994
Earlier work this paper cites.
M. Opper and O. Winther, “Gaussian processes for classification: Mean-field algorithms,” Neural Computation , pp. 2655–2684, 2000
2000
Earlier work this paper cites.
T. P. Minka, “Expectation propagation for approximate bayesian inference,” in Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence , ser. UAI ’01, 2001, pp. 362–369
2001
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.
T. Tanaka, “A statistical-mechanics approach to large-system analysis of cdma multiuser detectors,” IEEE Transactions on Information Theory , vol. 48, no. 11, pp. 2888–2910, Nov 2002
2002
Earlier work this paper cites.
Y. Kabashima, “A CDMA multiuser detection algorithm on the basis of belief propagation,” Journal of Physics A: Mathematical and General , vol. 36.43, p. 11111, October 2003
2003
Earlier work this paper cites.
R. R. Müller, “Applications of large random matrices in communications engineering,” in International Conference on Advances in the Internet, Processing, Systems, and Interdisciplinary Research (IPSI) , Sveti Stefan, Montegro, October 2003
2003
Earlier work this paper cites.
M. L. Mehta, Random matrices . Elsevier Academic press, 2004
2004
Cited alongside, same era.
M. Opper and O. Winther, “Expectation consistent approximate inference,” Journal of Machine Learning Research , 6 (2005): 2177-2204
2005
Cited alongside, same era.
A. Guionnet and M. Maïda, “A Fourier view on the R-transform and related asymptotics of spherical integrals,” Journal of Functional Analysis , vol. 222, no. 2, pp. 435 – 490, 2005
2005
Cited alongside, same era.
F. Hiai and D. Petz, The Semicirle Law, Free Random Variables and Entropy . American Mathematical Society, 2006
2006
Cited alongside, same era.
J. Sethna, Statistical mechanics: entropy, order parameters, and complexity . Oxford University Press, 2006, vol. 14
2006
Cited alongside, same era.
F. Krzakala, M. Mézard, F. Sausset, Y. Sun, and L. Zdeborová, “Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices,” Journal of Statistical Mechanics: Theory and Experiment , vol. 2012, no. P08009, 2012
2012
Later among the works it cites.
C. TEMPLATES. (2012) 1bit compressive sensing. [Online]. Available: http://dsp.rice.edu/1bitCS/
2012
Later among the works it cites.
M. Opper, U. Paquet, and O. Winther, “Perturbative corrections for approximate inference in gaussian latent variable models,” J. Mach. Learn. Res. , vol. 14, no. 1, pp. 2857–2898, jan 2013
2013
Later among the works it cites.
U. Haagerup and S. Möller, “The law of large numbers for the free multiplicative convolution,” Operator Algebra and Dynamics. Springer Proceedings in Mathematics & Statistics , vol. 58, pp. 157–186, 2013
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
B. Collins and P. Sniady, “Integration with respect to the Haar measure on unitary, orthogonal and symplectic group,” Communications in Mathematical Physics , vol. 264.3, pp. 773–795, 2006
2006
Cited alongside, same era.
E. J. Candes and T. Tao, “Near-optimal signal recovery from random projections: Universal encoding strategies?” IEEE Transactions on Information Theory , vol. 52, no. 12, pp. 5406–5425, Dec 2006
2006
Cited alongside, same era.
Y. Kabashima, “Inference from correlated patterns: a unified theory for perceptron learning and linear vector channels,” Journal of Physics: Conference Series , vol. 95, no. 1, 2008
2008
Cited alongside, same era.
K. B. Petersen and M. S. Pedersen, The Matrix Cookbook . Copenhagen, Denmark: Technical University of Denmark, 2008
2008
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, pp. 18 914–18 919, September 2009
2009
Cited alongside, same era.
S. Rangan, “Generalized approximate message passing for estimation with random linear mixing,” in Proc. IEEE International Symposium on Information Theory (ISIT) , Saint-Petersburg, Russia, July 2011
2011
Cited alongside, same era.
G. Akemann, J. Baik, and P. Di Francesco, Eds., The Oxford Handbook of Random Matrix Theory . Oxford University Press, 2011
2011
Cited alongside, same era.
A. M. Tulino, G. Caire, S. Shamai, and S. Verdú, “Support recovery with sparsely sampled free random matrices,” IEEE Trans. Information Theory , vol. 59, pp. 4243–4271, 2013
2013
Later among the works it cites.
G. W. Anderson and B. Farrell, “Asymptotically liberating sequences of random unitary matrices,” Advances in Mathematics , vol. 255, pp. 381 – 413, 2014
2014
Later among the works it cites.
B. Çakmak, O. Winther, and B. H. Fleury, “S-AMP: Approximate message passing for general matrix ensembles,” in Proc. IEEE Information Theory Workshop (ITW) , Hobart, Tasmanina, Australia, November 2014
2014
Later among the works it cites.
J. Pielaszkiewicz, D. von Rosen, and M. Singull, “Cumulant-moment relation in free probability theory,” Acta et Commentationes Universitatis Tartuensis de Mathematica , vol. 18.2, pp. 265–278, 2014
2014
Later among the works it cites.
B. Çakmak, O. Winther, and B. H. Fleury, “S-amp for non-linear observation models,” in 2015 IEEE International Symposium on Information Theory (ISIT) , June 2015, pp. 2807–2811
2015
Later among the works it cites.
2015
Later among the works it cites.
M. Vehkapera, 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, 2016
2016
Closest in time.
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
Closest in time.