J WainwrightMartin

发表

Sharp thresholds for high-dimensional and noisy sparsity recovery using l1-constrained quadratic programming (Lasso)

J WainwrightMartin, 2009 .

Privacy Aware Learning

I JordanMichael, J WainwrightMartin, C DuchiJohn, 2014 .

Low-density graph codes that are optimal for binning and coding with side information

J WainwrightMartin, MartinianEmin, 2009 .

A new look at survey propagation and its generalizations

MosselElchanan, J WainwrightMartin, ManevaElitza, 2007 .

Stochastically Transitive Models for Pairwise Comparisons

J WainwrightMartin, B ShahNihar, BalakrishnanSivaraman, 2017 .

Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$ -Balls

YuBin, J WainwrightMartin, RaskuttiGarvesh, 2011 .

Graphical Models, Exponential Families, and Variational Inference

I JordanMichael, J WainwrightMartin, 2008 .

Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes

J WainwrightMartin, AgarwalAlekh, RavikumarPradeep, 2010 .

Information-theoretic limits on sparse signal recovery

WangWei, RamchandranKannan, J WainwrightMartin, 2010 .

Communication-efficient algorithms for statistical optimization

J WainwrightMartin, C DuchiJohn, ZhangYuchen, 2013 .

Fast MCMC sampling algorithms on polytopes

YuBin, J WainwrightMartin, ChenYuansi, 2018 .

Minimax-optimal rates for sparse additive models over kernel classes via convex programming

YuBin, J WainwrightMartin, RaskuttiGarvesh, 2012 .

Regularized M-estimators with nonconvexity

J WainwrightMartin, LohPo-Ling, 2015 .