Mutual Information in Rank-One Matrix Estimation

Y. Iba, “The nishimori line and bayesian statistics,” Journal of Physics A: Mathematical and General , vol. 32, no. 21, p. 3875, 1999

1999

Earlier work this paper cites.

H. Nishimori, Statistical Physics of Spin Glasses and Information Processing: An Introduction . Oxford University Press, 2001

2001

Earlier work this paper cites.

F. Guerra, “Broken replica symmetry bounds in the mean field spin glass model,” Communications in mathematical physics , vol. 233, p. 1, 2003

2003

Earlier work this paper cites.

S. Franz, M. Leone, and F. L. Toninelli, “Replica bounds for diluted non-poissonian spin systems,” Journal of Physics A: Mathematical and General , vol. 36, no. 43, p. 10967, 2003

2003

Earlier work this paper cites.

J. Baik, G. Ben Arous, and S. Péché, “Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices,” Annals of Probability , pp. 1643–1697, 2005

2005

Earlier work this paper cites.

R. Latała, “Some estimates of norms of random matrices,” Proceedings of the American Mathematical Society , vol. 133, no. 5, p. 1273, 2005

2005

Earlier work this paper cites.

S. Chatterjee, “A generalization of the lindeberg principle,” Ann. Probab. , vol. 34, no. 6, pp. 2061–2076, 11 2006. [Online]. Available: http://dx.doi.org/10.1214/009117906000000575

2006

Earlier work this paper cites.

S. B. Korada and N. Macris, “Exact solution of the gauge symmetric p-spin glass model on a complete graph,” Journal of Statistical Physics , vol. 136, no. 2, pp. 205–230, 2009

2009

Earlier work this paper cites.

M. Mézard and A. Montanari, Information, Physics, and Computation . Oxford: Oxford Press, 2009

2009

Cited alongside, same era.

S. B. Korada and N. Macris, “Tight bounds on the capacity of binary input random cdma systems,” Information Theory, IEEE Transactions on , vol. 56, no. 11, pp. 5590–5613, 2010

2010

Cited alongside, same era.

S. B. Korada and A. Montanari, “Applications of the lindeberg principle in communications and statistical learning,” IEEE Transactions on Information Theory , vol. 57, no. 4, pp. 2440–2450, April 2011

2011

Cited alongside, same era.

S. Rangan and A. K. Fletcher, “Iterative estimation of constrained rank-one matrices in noise,” in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on . IEEE, 2012, pp. 1246–1250

2012

Cited alongside, same era.

E. Mossel, J. Neeman, and A. Sly, “A proof of the block model threshold conjecture,” arxiv:1311.4115 , 2013

L. Massoulié, “Community detection thresholds and the weak ramanujan property,” in Proceedings of the 46th Annual ACM Symposium on Theory of Computing . ACM, 2014, pp. 694–703

2014

Later among the works it cites.

E. Abbe, A. S. Bandeira, A. Bracher, and A. Singer, “Decoding binary node labels from censored edge measurements: Phase transition and efficient recovery,” Network Science and Engineering, IEEE Transactions on , vol. 1, no. 1, pp. 10–22, 2014

2014

Later among the works it cites.

T. Lesieur, F. Krzakala, and L. Zdeborová, “Mmse of probabilistic low-rank matrix estimation: Universality with respect to the output channel,” arXiv preprint arXiv:1507.03857 , 2015

Original

2015

Later among the works it cites.

B. Hajek, Y. Wu, and J. Xu, “Submatrix localization via message passing,” arXiv preprint arXiv:1510.09219 , 2015

Original

2015

Later among the works it cites.