An overview of the estimation of large covariance and precision matrices
The estimation of large covariance and precision matrices is fundamental in modern
multivariate analysis. However, problems arise from the statistical analysis of large panel …
multivariate analysis. However, problems arise from the statistical analysis of large panel …
Structured regularizers for high-dimensional problems: Statistical and computational issues
MJ Wainwright - Annual Review of Statistics and Its Application, 2014 - annualreviews.org
Regularization is a widely used technique throughout statistics, machine learning, and
applied mathematics. Modern applications in science and engineering lead to massive and …
applied mathematics. Modern applications in science and engineering lead to massive and …
[图书][B] Statistical foundations of data science
Statistical Foundations of Data Science gives a thorough introduction to commonly used
statistical models, contemporary statistical machine learning techniques and algorithms …
statistical models, contemporary statistical machine learning techniques and algorithms …
A Constrained ℓ1 Minimization Approach to Sparse Precision Matrix Estimation
This article proposes a constrained ℓ 1 minimization method for estimating a sparse inverse
covariance matrix based on a sample of n iid p-variate random variables. The resulting …
covariance matrix based on a sample of n iid p-variate random variables. The resulting …
High-dimensional regression with noisy and missing data: Provable guarantees with non-convexity
PL Loh, MJ Wainwright - Advances in neural information …, 2011 - proceedings.neurips.cc
Although the standard formulations of prediction problems involve fully-observed and
noiseless data drawn in an iid manner, many applications involve noisy and/or missing data …
noiseless data drawn in an iid manner, many applications involve noisy and/or missing data …
High-dimensional semiparametric Gaussian copula graphical models
We propose a semiparametric approach called the nonparanormal SKEPTIC for efficiently
and robustly estimating high-dimensional undirected graphical models. To achieve …
and robustly estimating high-dimensional undirected graphical models. To achieve …
[PDF][PDF] Divide and conquer kernel ridge regression: A distributed algorithm with minimax optimal rates
We study a decomposition-based scalable approach to kernel ridge regression, and show
that it achieves minimax optimal convergence rates under relatively mild conditions. The …
that it achieves minimax optimal convergence rates under relatively mild conditions. The …
Structured sparsity through convex optimization
Sparse estimation methods are aimed at using or obtaining parsimonious representations of
data or models. While naturally cast as a combinatorial optimization problem, variable or …
data or models. While naturally cast as a combinatorial optimization problem, variable or …
Two-sample test of high dimensional means under dependence
T Tony Cai, W Liu, Y Xia - Journal of the Royal Statistical Society …, 2014 - academic.oup.com
The paper considers in the high dimensional setting a canonical testing problem in
multivariate analysis, namely testing the equality of two mean vectors. We introduce a new …
multivariate analysis, namely testing the equality of two mean vectors. We introduce a new …
Estimating structured high-dimensional covariance and precision matrices: Optimal rates and adaptive estimation
This is an expository paper that reviews recent developments on optimal estimation of
structured high-dimensional covariance and precision matrices. Minimax rates of …
structured high-dimensional covariance and precision matrices. Minimax rates of …