See also Arxiv and Google Scholar


Y. Deshpande, A. Javanmard, M. Mehrabi, Online Debiasing for Adaptively Collected High Dimensional Data

Y. Deshpande, L. Mackey, V. Syrgkanis, M. Taddy, Accurate Inference for Adaptive Linear Models, (preliminary version at ICML 2018)

Published articles

Y. Deshpande, A. Montanari, R. O'Donnell, T. Schramm, S. Sen, The threshold for SDP-refutation of random regular NAE-3SAT, 2018 (SODA 2019)

Y. Deshpande, A. Montanari, E. Mossel, S. Sen, Contextual Stochastic Block Models, NeurIPS 2018 (Spotlight Presentation)

M. Erdogdu, Y. Deshpande, A. Montanari Inference in Graphical Models via Semidefinite Programming Hierarchies, NeurIPS 2017

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, Information and Inference: a Journal of the IMA, 2016

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, NeurIPS 2014

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

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

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

Y. Deshpande, A. Montanari, Linear Bandits in High Dimension and Recommendation Systems, (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