Andrea Montanari

 

Associate Professor,
Department of Electrical Engineering and
Department of Statistics,
Stanford University

Contact

Packard 272, Stanford, CA 94304
Tel: (650) 736-7422
Fax: (650) 723-8473
montanari@stanford.edu

Some recent papers

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

D. Donoho, I. Johnstone and A. Montanari, Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising, 2011

Y. Kanoria, A. Montanari, D. Tse and B. Zhang, Distributed Storage for Intermittent Energy Sources: Control Design and Performance Limits, 2011

A. Dembo, A. Montanari and N. Sun, Factor models on locally tree-like graphs, 2011

Y. Kanoria and A. Montanari, Optimal coding for the deletion channel with small deletion probability, 2011 (conference version ISIT2010)

S. Korada, A. Montanari, and S. Oh, Gossip PCA, Sigmetrics 2011

A. Javanmard and A. Montanari, Localization from Incomplete Noisy Distance Measurements, 2011 (conference version ISIT 2011)

J. Bento, M. Ibrahimi and A. Montanari, Learning Networks of Stochastic Differential Equations, NIPS 2010

A. Montanari. Graphical Models Concepts in Compressed Sensing, 2010

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

M. Bayati and A. Montanari, The LASSO Risk for Gaussian Matrices, 2010 (related work with J. Bento, NIPS 2010)

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

Y. Kanoria, M. Bayati, C. Borgs, J. Chayes, A. Montanari, Fast Convergence of Natural Bargaining Dynamics in Exchange Networks, SODA 2010

M. Bayati and A. Montanari. The dynamics of message passing on dense graphs, with applications to compressed sensing, IEEE Trans. Inform. Theory 2010 (conference version ISIT 2010)

R. Keshavan, A. Montanari and S. Oh. Matrix Completion from Noisy Entries, JMLR 2010 (conference version NIPS 2009, and sofware)

R. Keshavan, A. Montanari and S. Oh. Matrix Completion from A Few Entries, IEEE Trans. Inform. Theory 2010 (conference version ISIT 2009, and sofware)

F. Krzakala, A. Montanari, F. Ricci-Tersenghi, G. Semerjian and L. Zdeborova. Gibbs States and the Set of Solutions of Random Constraint Satisfaction Problems, Proc. Natl. Acad. Sci., 2007