Publications

See also Arxiv and Google Scholar

Y. Deshpande Computational Limits in Statistical Estimation: Hidden Clique and Related Problems, 2016 (also available here)

Y. Deshpande, E. Abbe and A. Montanari Asymptotic Mutual Information in the Two Groups Stochastic Block Model, 2015 (Accepted to Information and Inference: a Journal of the IMA)

Y. Deshpande, A. Montanari, Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems, Conference on Learning Theory, 2015

Y. Deshpande, A. Montanari and E. Richard, Cone-Constrained Principal Component Analysis, Neural Information Processing Systems (NIPS), 2014

Y. Deshpande, A. Montanari, Sparse PCA via Covariance Thresholding, Journal of Machine Learning Research, 2016 (short version in NIPS 2014)

Y. Deshpande, A. Montanari, Information-theoretically Optimal Sparse PCA, 2014

Y. Deshpande, A. Montanari, Finding Hidden Cliques of Size sqrt {N/e} in Nearly Linear Time, 2013

Y. Deshpande, A. Montanari, Linear Bandits in High Dimension and Recommendation Systems, 2012 (conference version Allerton 2012)

Y. Deshpande, S. R. B. Pillai and B. K. Dey, On the Sum Capacity of Multiaccess Block-Fading Channels with Individual Side Information
Information Theory Workshop, 2011