2014 - COPSS Presidents' Award For fundamental and groundbreaking contributions to high-dimensional statistics, graphical modeling, machine learning, optimization and algorithms covering deep and elegant mathematical analysis as well as new methodology with wide-ranging implications for numerous applications.
2005 - Fellow of Alfred P. Sloan Foundation
Martin J. Wainwright spends much of his time researching Mathematical optimization, Combinatorics, Estimator, Applied mathematics and Discrete mathematics. His Mathematical optimization research includes themes of Convergence, Sparse matrix and Convex optimization. His Combinatorics research is multidisciplinary, incorporating elements of Fixed point, Matrix norm, Factor graph, Rank and Statistics.
The concepts of his Estimator study are interwoven with issues in Optimization problem, Differential privacy and Covariance. He combines subjects such as Divide and conquer algorithms, Regularization and Principal component regression with his study of Applied mathematics. As a part of the same scientific family, Martin J. Wainwright mostly works in the field of Discrete mathematics, focusing on Linear programming and, on occasion, Linear code, Binary code, Posterior probability and Tree structure.
Martin J. Wainwright focuses on Algorithm, Mathematical optimization, Applied mathematics, Combinatorics and Minimax. His Algorithm study frequently links to related topics such as Artificial intelligence. His Mathematical optimization research is multidisciplinary, incorporating perspectives in Convergence, Estimation theory, Graphical model, Markov chain and Convex optimization.
The Applied mathematics study which covers Regularization that intersects with Linear regression. His study in Combinatorics is interdisciplinary in nature, drawing from both Discrete mathematics, Matrix, Distribution, Function and Upper and lower bounds. His research in Discrete mathematics intersects with topics in Fixed point and Belief propagation.
Martin J. Wainwright mostly deals with Algorithm, Applied mathematics, Combinatorics, Minimax and False discovery rate. His work deals with themes such as Sampling, LogitBoost, Estimator and Graphical model, which intersect with Algorithm. His work is dedicated to discovering how Estimator, Pairwise comparison are connected with Set and Ranking and other disciplines.
His Applied mathematics research incorporates elements of Stochastic approximation, Matrix, Convex function, Regular polygon and Gradient descent. Martin J. Wainwright combines subjects such as Distribution, Order and Rank with his study of Combinatorics. His Minimax study results in a more complete grasp of Mathematical optimization.
His primary areas of study are Algorithm, Applied mathematics, False discovery rate, Theoretical computer science and Combinatorics. His Algorithm research includes elements of Sampling, Discretization, Kernel, Metropolis–Hastings algorithm and Condition number. His work carried out in the field of Applied mathematics brings together such families of science as High-dimensional statistics, Convex function, Estimator, Optimization problem and Reinforcement learning.
His Combinatorics study combines topics in areas such as Distribution, Minimax and Markov chain Monte Carlo. The Complement study combines topics in areas such as Mathematical optimization and Convex optimization. Martin J. Wainwright incorporates Mathematical optimization and Estimation in his studies.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Graphical Models, Exponential Families, and Variational Inference
Martin J. Wainwright;Michael I. Jordan.
(2008)
Image denoising using scale mixtures of Gaussians in the wavelet domain
J. Portilla;V. Strela;M.J. Wainwright;E.P. Simoncelli.
IEEE Transactions on Image Processing (2003)
Network Coding for Distributed Storage Systems
A G Dimakis;P B Godfrey;Yunnan Wu;M J Wainwright.
IEEE Transactions on Information Theory (2010)
Statistical Learning with Sparsity: The Lasso and Generalizations
Trevor Hastie;Robert Tibshirani;Martin Wainwright.
(2015)
Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $ll _{1}$ -Constrained Quadratic Programming (Lasso)
M.J. Wainwright.
IEEE Transactions on Information Theory (2009)
A Unified Framework for High-Dimensional Analysis of $M$-Estimators with Decomposable Regularizers
Sahand N. Negahban;Pradeep Ravikumar;Martin J. Wainwright;Bin Yu.
Statistical Science (2012)
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
J. C. Duchi;A. Agarwal;M. J. Wainwright.
IEEE Transactions on Automatic Control (2012)
High-dimensional Ising model selection using ℓ1-regularized logistic regression
Pradeep Ravikumar;Martin J. Wainwright;John D. Lafferty.
Annals of Statistics (2010)
MAP estimation via agreement on trees: message-passing and linear programming
M.J. Wainwright;T.S. Jaakkola;A.S. Willsky.
IEEE Transactions on Information Theory (2005)
High-dimensional covariance estimation by minimizing ℓ1-penalized log-determinant divergence
Pradeep Ravikumar;Martin J. Wainwright;Garvesh Raskutti;Bin Yu.
Electronic Journal of Statistics (2011)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
University of California, Berkeley
University of California, Berkeley
Stanford University
MIT
Microsoft (United States)
University of Copenhagen
University of California, Berkeley
University of California, Berkeley
The University of Texas at Austin
Carnegie Mellon University
French Institute for Research in Computer Science and Automation - INRIA
Publications: 80
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: