Fetching the paper…
Reading the bibliography…
This paper considers probabilistic estimation of a low-rank matrix from non-linear element-wise measurements of its elements.
D. J. Thouless, P. W. Anderson, and R. G. Palmer, “Solution of ‘solvable model of a spin-glass’,” Phil. Mag. , vol. 35, p. 593, 1977
1977
Earlier work this paper cites.
D. Gross, I. Kanter, and H. Sompolinsky, “Mean-field theory of the Potts glass,” Physical review letters , vol. 55, no. 3, p. 304, 1985
1985
Earlier work this paper cites.
Y. Cheng and G. M. Church, “Biclustering of expression data.” in Ismb , vol. 8, 2000, pp. 93–103
2000
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.
A. Mnih and R. Salakhutdinov, “Probabilistic matrix factorization,” in Advances in neural information processing systems , 2007, p. 1257
2007
Earlier work this paper cites.
D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” Proc. Natl. Acad. Sci. , vol. 106, no. 45, pp. 18 914–18 919, 2009
2009
Earlier work this paper cites.
A. A. Shabalin, V. J. Weigman, C. M. Perou, and A. B. Nobel, “Finding large average submatrices in high dimensional data,” The Annals of Applied Statistics , pp. 985–1012, 2009
2009
Earlier work this paper cites.
M. Mézard and A. Montanari, Information, Physics, and Computation . Oxford: Oxford Press, 2009
2009
Earlier work this paper cites.
2009
Earlier work this paper cites.
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, p. 764, 2011
2011
Cited alongside, same era.
S. Rangan, “Generalized approximate message passing for estimation with random linear mixing,” in IEEE International Symposium on Information Theory Proceedings (ISIT) , 2011, pp. 2168 –2172
2011
Cited alongside, same era.
A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová, “Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications,” Phys. Rev. E , vol. 84, no. 6, p. 066106, 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.
Y. Deshpande and A. Montanari, “Information-theoretically optimal sparse PCA,” in Information Theory (ISIT), 2014 IEEE International Symposium on , 2014, pp. 2197–2201
2014
Later among the works it cites.
2014
Later among the works it cites.
2014
Later among the works it cites.
2015
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. R. Nadakuditi and M. E. Newman, “Graph spectra and the detectability of community structure in networks,” Physical review letters , vol. 108, no. 18, p. 188701, 2012
2012
Cited alongside, same era.
F. Caltagirone, G. Parisi, and T. Rizzo, “Dynamical critical exponents for the mean-field Potts glass,” Phys. Rev. E , vol. 85, no. 5, p. 051504, 2012
2012
Cited alongside, same era.
2013
Cited alongside, same era.
M. Lelarge, L. Massoulié, and J. Xu, “Reconstruction in the labeled stochastic block model,” in Information Theory Workshop (ITW), 2013 IEEE . IEEE, 2013, pp. 1–5
2013
Cited alongside, same era.
R. Matsushita and T. Tanaka, “Low-rank matrix reconstruction and clustering via approximate message passing,” in Advances in Neural Information Processing Systems , 2013, pp. 917–925
2013
Cited alongside, same era.
I. Carron, “The matrix factorization jungle,” https://sites.google.com/site/igorcarron2/matrixfactorizations
Cited in the paper.
Z. Ma, Y. Wu et al. , “Computational barriers in minimax submatrix detection,” The Annals of Statistics , vol. 43, no. 3, p. 1089, 2015
2015
Closest in time.
Y. Deshpande and A. Montanari, “Finding hidden cliques of size N / e \sqrt{N/e} in nearly linear time,” Foundations of Computational Mathematics , pp. 1–60, 2015
2015
Closest in time.
2015
Closest in time.
J. Wright, A. Ganesh, S. Rao, Y. Peng, and Y. Ma, “Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization,” in Advances in neural information processing systems , 2009, pp. 2080–2088
2088
Closest in time.