#### Filter Results:

- Full text PDF available (236)

#### Publication Year

1996

2017

- This year (12)
- Last 5 years (93)
- Last 10 years (181)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Cell Type

#### Data Set Used

#### Key Phrases

Learn More

- Martin J. Wainwright, Michael I. Jordan
- Foundations and Trends in Machine Learning
- 2008

- Alexandros G. Dimakis, Brighten Godfrey, Yunnan Wu, Martin J. Wainwright, Kannan Ramchandran
- IEEE Transactions on Information Theory
- 2007

Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-peer storage systems, and storage in wireless networks. Storing data using an erasure code, in fragments spread across nodes, requires less redundancy than simple replication for the… (More)

- Javier Portilla, Vasily Strela, Martin J. Wainwright, Eero P. Simoncelli
- IEEE Trans. Image Processing
- 2003

We describe a method for removing noise from digital images, based on a statistical model of the coefficients of an overcomplete multiscale oriented basis. Neighborhoods of coefficients at adjacent positions and scales are modeled as the product of two independent random variables: a Gaussian vector and a hidden positive scalar multiplier. The latter… (More)

- John C. Duchi, Alekh Agarwal, Martin J. Wainwright
- IEEE Trans. Automat. Contr.
- 2012

—The goal of decentralized optimization over a network is to optimize a global objective formed by a sum of local (possibly nonsmooth) convex functions using only local computation and communication. It arises in various application domains, including distributed tracking and localization, multi-agent coordination , estimation in sensor networks, and… (More)

We consider the problem of estimating the graph associated with a binary Ising Markov random field. We describe a method based on ℓ1-regularized logistic regression, in which the neighborhood of any given node is estimated by performing logistic regression subject to an ℓ1-constraint. The method is analyzed under high-dimensional scaling, in which both the… (More)

High-dimensional statistical inference deals with models in which the the number of parameters p is comparable to or larger than the sample size n. Since it is usually impossible to obtain consistent procedures unless p/n → 0, a line of recent work has studied models with various types of low-dimensional structure, including sparse vectors, sparse and… (More)

—The problem of consistently estimating the sparsity pattern of a vector 3 2 p based on observations contaminated by noise arises in various contexts, including signal denoising, sparse approximation, compressed sensing, and model selection. We analyze the behavior of`1-constrained quadratic programming (QP), also referred to as the Lasso, for recovering… (More)

- John C. Duchi, Michael I. Jordan, Martin J. Wainwright
- 2013 IEEE 54th Annual Symposium on Foundations of…
- 2013

Working under local differential privacy-a model of privacy in which data remains private even from the statistician or learner-we study the tradeoff between privacy guarantees and the utility of the resulting statistical estimators. We prove bounds on information-theoretic quantities, including mutual information and Kullback-Leibler divergence, that… (More)

- Sahand Negahban, Martin J. Wainwright
- ICML
- 2010

We study an instance of high-dimensional inference in which the goal is to estimate a matrix Θ * ∈ R m 1 ×m 2 on the basis of N noisy observations. The unknown matrix Θ * is assumed to be either exactly low rank, or " near " low-rank, meaning that it can be well-approximated by a matrix with low rank. We consider a standard M-estimator based on… (More)

- Po-Ling Loh, Martin J. Wainwright
- NIPS
- 2013

We establish theoretical results concerning local optima of regularized M-estimators, where both loss and penalty functions are allowed to be nonconvex. Our results show that as long as the loss satisfies restricted strong convexity and the penalty satisfies suitable regularity conditions, any local optimum of the composite objective lies within statistical… (More)