Andrea Montanari


Department of Electrical Engineering and
Department of Statistics,
Stanford University


Packard 272, Stanford, CA 94304
Tel: (650) 736-7422
Fax: (650) 723-8473

Some representative papers

S. Mei, Y. Bai and A. Montanari, The landscape of empirical risk for non-convex losses, 2017

A. Montanari and N. Sun, Spectral algorithms for tensor completion, 2016

A. Javanmard and A. Montanari, Online Rules for Control of False Discovery Rate and False Discovery Exceedance, 2015

A. Javanmard, A. Montanari, and F. Ricci-Tersenghi, Phase Transitions in Semidefinite Relaxations, (Including Supplementary Information), 2015 (code)

A. Montanari and S.Sen Semidefinite Programs on Sparse Random Graphs and their Application to Community Detection, 2015

A. Dembo, A. Montanari, S. Sen, Extremal Cuts of Sparse Random Graphs, 2015

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

A. Montanari, Computational implications of reducing data to sufficient statistics, 2014

D. Donoho and A. Montanari, High Dimensional Robust M-Estimation: Asymptotic Variance via Approximate Message Passing, 2013

A. Javanmard and A. Montanari, Confidence Intervals and Hypothesis Testing for High-Dimensional Regression, 2013 (code)

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

M. Bayati, M. Lelarge and A. Montanari, Universality in Polytope Phase Transitions and Message Passing Algorithms, 2012

D. Donoho, A. Javanmard and A. Montanari, Information-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing, 2011 (related numerical simulations)

A. Montanari and A. Saberi, The Spread of Innovations in Social Networks, Proc. Natl. Acad. Sci., 2010 (conference version FOCS 2009)

D.L. Donoho, A. Maleki, and A. Montanari. Message passing algorithms for compressed sensing, Proc. Natl. Acad. Sci., 2009