194 citations · 766 across the 24 of their papers we have counts for
7 papers · 1 filter
Guessing Facets: Polytope Structure and Improved LP Decoder
Alexandros G. Dimakis, Martin J. Wainwright
A new approach for decoding binary linear codes by solving a linear program (LP) over a relaxed codeword polytope was recently proposed by Feldman et al. In this paper we investiga…
Sharp thresholds for high-dimensional and noisy recovery of sparsity
Martin J. Wainwright
The problem of consistently estimating the sparsity pattern of a vector $\betastar \in \real^\mdim$ based on observations contaminated by noise arises in various contexts, includin…
Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds
Emin Martinian, Martin J. Wainwright
We describe and analyze sparse graphical code constructions for the problems of source coding with decoder side information (the Wyner-Ziv problem), and channel coding with encoder…
Inconsistent parameter estimation in Markov random fields: Benefits in the computation-limited setting
Martin J. Wainwright
Consider the problem of joint parameter estimation and prediction in a Markov random field: i.e., the model parameters are estimated on the basis of an initial set of data, and the…
Geographic Gossip: Efficient Aggregation for Sensor Networks
Alexandros G. Dimakis, Anand D. Sarwate, Martin J. Wainwright
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain env…
Analysis of LDGM and compound codes for lossy compression and binning
Emin Martinian, Martin J. Wainwright
Recent work has suggested that low-density generator matrix (LDGM) codes are likely to be effective for lossy source coding problems. We derive rigorous upper bounds on the effecti…