activity
19972026
most citedMessage Passing Algorithms for Compressed Sensing

2.5k citations · 10k across the 171 of their papers we have counts for

collaborators
Showing 2010Show all

9 papers · 1 filter

cs.IT2010★ 14 cited

Lossy compression of discrete sources via Viterbi algorithm

Shirin Jalali, Andrea Montanari, Tsachy Weissman

We present a new lossy compressor for discrete-valued sources. For coding a sequence , the encoder starts by assigning a certain cost to each possible reconstruction sequence.…

cs.IT2010

Graphical Models Concepts in Compressed Sensing

Andrea Montanari

This paper surveys recent work in applying ideas from graphical models and message passing algorithms to solve large scale regularized regression problems. In particular, the focus…

math.ST2010★ 43 cited

Learning Networks of Stochastic Differential Equations

José Bento, Morteza Ibrahimi, Andrea Montanari

We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the dy…

math.ST2010★ 10 cited

The LASSO risk for gaussian matrices

Mohsen Bayati, Andrea Montanari

We consider the problem of learning a coefficient vector x_0\in R^N from noisy linear observation y=Ax_0+w \in R^n. In many contexts (ranging from model selection to image processi…

cs.DM2010★ 6 cited

On the concentration of the number of solutions of random satisfiability formulas

Emmanuel Abbe, Andrea Montanari

Let be the number of solutions of a random -satisfiability formula with variables and clause density . Assume that the probability that is unsatisfiable is…

math.ST2010★ 10 cited

The Noise-Sensitivity Phase Transition in Compressed Sensing

David L. Donoho, Arian Maleki, Andrea Montanari

Consider the noisy underdetermined system of linear equations: y=Ax0 + z0, with n x N measurement matrix A, n < N, and Gaussian white noise z0 ~ N(0,σ^2 I). Both y and A are known,…

cs.IT2010★ 2 cited

Applications of Lindeberg Principle in Communications and Statistical Learning

Satish Babu Korada, Andrea Montanari

We use a generalization of the Lindeberg principle developed by Sourav Chatterjee to prove universality properties for various problems in communications, statistical learning and…

cs.GT2010★ 3 cited

Bargaining dynamics in exchange networks

Mohsen Bayati, Christian Borgs, Jennifer Chayes +2

We consider a one-sided assignment market or exchange network with transferable utility and propose a model for the dynamics of bargaining in such a market. Our dynamical model is…

stat.ML2010★ 3 cited

Regularization for Matrix Completion

Raghunandan H. Keshavan, Andrea Montanari

We consider the problem of reconstructing a low rank matrix from noisy observations of a subset of its entries. This task has applications in statistical learning, computer vision,…