2.5k citations · 10k across the 171 of their papers we have counts for
12 papers · 1 filter
Information-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing
David L. Donoho, Adel Javanmard, Andrea Montanari
We study the compressed sensing reconstruction problem for a broad class of random, band-diagonal sensing matrices. This construction is inspired by the idea of spatial coupling in…
Robust Max-Product Belief Propagation
Morteza Ibrahimi, Adel Javanmard, Yashodhan Kanoria +1
We study the problem of optimizing a graph-structured objective function under \emph{adversarial} uncertainty. This problem can be modeled as a two-persons zero-sum game between an…
Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising
David Donoho, Iain Johnstone, Andrea Montanari
Compressed sensing posits that, within limits, one can undersample a sparse signal and yet reconstruct it accurately. Knowing the precise limits to such undersampling is important…
Distributed Storage for Intermittent Energy Sources: Control Design and Performance Limits
Yashodhan Kanoria, Andrea Montanari, David Tse +1
One of the most important challenges in the integration of renewable energy sources into the power grid lies in their `intermittent' nature. The power output of sources like wind a…
On the trade-off between complexity and correlation decay in structural learning algorithms
José Bento, Andrea Montanari
We consider the problem of learning the structure of Ising models (pairwise binary Markov random fields) from i.i.d. samples. While several methods have been proposed to accomplish…
Factor models on locally tree-like graphs
Amir Dembo, Andrea Montanari, Nike Sun
We consider homogeneous factor models on uniformly sparse graph sequences converging locally to a (unimodular) random tree , and study the existence of the free energy density $…
The set of solutions of random XORSAT formulae
Morteza Ibrahimi, Yash Kanoria, Matt Kraning +1
The XOR-satisfiability (XORSAT) problem requires finding an assignment of Boolean variables that satisfy exclusive OR (XOR) clauses, whereby each clause constrains a subset…
Optimal coding for the deletion channel with small deletion probability
Yashodhan Kanoria, Andrea Montanari
The deletion channel is the simplest point-to-point communication channel that models lack of synchronization. Input bits are deleted independently with probability d, and when the…
Subexponential convergence for information aggregation on regular trees
Yashodhan Kanoria, Andrea Montanari
We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k>=2, we assume…
Compressed Sensing over -balls: Minimax Mean Square Error
David Donoho, Iain Johnstone, Arian Maleki +1
We consider the compressed sensing problem, where the object $x_0 \in \bR^N$ is to be recovered from incomplete measurements ; here the sensing matrix is an $n \t…
Information Theoretic Limits on Learning Stochastic Differential Equations
José Bento, Morteza Ibrahimi, Andrea Montanari
Consider the problem of learning the drift coefficient of a stochastic differential equation from a sample path. In this paper, we assume that the drift is parametrized by a high d…
Localization from Incomplete Noisy Distance Measurements
Adel Javanmard, Andrea Montanari
We consider the problem of positioning a cloud of points in the Euclidean space , using noisy measurements of a subset of pairwise distances. This task has applicatio…