The following pages link to Martin J. Wainwright (Q209971):
Displaying 50 items.
- A new look at survey propagation and its generalizations (Q3546340) (← links)
- Image denoising using scale mixtures of gaussians in the wavelet domain (Q3546424) (← links)
- Using Linear Programming to Decode Binary Linear Codes (Q3546868) (← links)
- A New Class of Upper Bounds on the Log Partition Function (Q3547761) (← links)
- MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming (Q3547762) (← links)
- LP Decoding Corrects a Constant Fraction of Errors (Q3548232) (← links)
- Graphical Models, Exponential Families, and Variational Inference (Q3580906) (← links)
- On Optimal Quantization Rules for Some Problems in Sequential Decentralized Detection (Q3604459) (← links)
- (Q4558208) (← links)
- Simple, Robust and Optimal Ranking from Pairwise Comparisons (Q4558526) (← links)
- Geographic Gossip: Efficient Averaging for Sensor Networks (Q4567739) (← links)
- Convergence Analysis of Reweighted Sum-Product Algorithms (Q4568781) (← links)
- Network-Based Consensus Averaging With General Noisy Channels (Q4572768) (← links)
- Log-determinant relaxation for approximate inference in discrete Markov random fields (Q4588104) (← links)
- (Q4589006) (← links)
- High-Dimensional Statistics (Q4622691) (← links)
- Statistical and Computational Guarantees for the Baum-Welch Algorithm (Q4637049) (← links)
- Tree-based reparameterization framework for analysis of sum-product and related algorithms (Q4680078) (← links)
- Minimax Optimal Procedures for Locally Private Estimation (Q4690944) (← links)
- Rejoinder (Q4690950) (← links)
- Network Coding for Distributed Storage Systems (Q4968711) (← links)
- Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systems (Q4969058) (← links)
- (Q4969156) (← links)
- Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting (Q4974108) (← links)
- Low-Density Graph Codes That Are Optimal for Binning and Coding With Side Information (Q4975760) (← links)
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso) (Q4975847) (← links)
- Guessing Facets: Polytope Structure and Improved LP Decoder (Q4975946) (← links)
- Lossy Source Compression Using Low-Density Generator Matrix Codes: Analysis and Algorithms (Q4975985) (← links)
- Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes (Q4976041) (← links)
- (Q4998932) (← links)
- A Permutation-Based Model for Crowd Labeling: Optimal Estimation and Robustness (Q5001782) (← links)
- Minimax Off-Policy Evaluation for Multi-Armed Bandits (Q5096994) (← links)
- Optimal Rates and Tradeoffs in Multiple Testing (Q5109917) (← links)
- The Local Geometry of Testing in Ellipses: Tight Control via Localized Kolmogorov Widths (Q5124490) (← links)
- Instance-Dependent ℓ<sub>∞</sub>-Bounds for Policy Evaluation in Tabular Reinforcement Learning (Q5151732) (← links)
- Is Temporal Difference Learning Optimal? An Instance-Dependent Analysis (Q5162625) (← links)
- Early Stopping for Kernel Boosting Algorithms: A General Analysis With Localized Complexities (Q5211468) (← links)
- Low Permutation-rank Matrices: Structural Properties and Noisy Completion (Q5214186) (← links)
- Convergence guarantees for a class of non-convex and non-smooth optimization problems (Q5214248) (← links)
- (Q5214293) (← links)
- Feeling the Bern: Adaptive Estimators for Bernoulli Probabilities of Pairwise Comparisons (Q5224116) (← links)
- (Q5251797) (← links)
- Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions (Q5271791) (← links)
- Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization (Q5271983) (← links)
- Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls (Q5272318) (← links)
- Simultaneous Support Recovery in High Dimensions: Benefits and Perils of Block $\ell _{1}/\ell _{\infty} $-Regularization (Q5273638) (← links)
- Estimating Divergence Functionals and the Likelihood Ratio by Convex Risk Minimization (Q5281236) (← links)
- Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices (Q5281472) (← links)
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling (Q5352733) (← links)
- Embedded Trees: Estimation of Gaussian Processes on Graphs with Cycles (Q5355560) (← links)
