.png){kind=icon}
.png){kind=icon}
Return
An imputation-regularized optimization algorithm for high dimensional missing data problems and beyond
.png){kind=icon}
OA
AI
DOI：10.1111/rssb.12279.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Missing data are frequently encountered in high dimensional problems, but they are usually difficult to deal with by using standard algorithms, such as the expectation-maximization algorithm and its variants. To tackle this difficulty, some problem-specific algorithms have been developed in the literature, but there still lacks a general algorithm. This work is to fill the gap: we propose a general algorithm for high dimensional missing data problems. The algorithm works by iterating between an imputation step and a regularized optimization step. At the imputation step, the missing data are imputed conditionally on the observed data and the current estimates of parameters and, at the regularized optimization step, a consistent estimate is found via the regularization approach for the minimizer of a Kullback-Leibler divergence defined on the pseudocomplete data. For high dimensional problems, the consistent estimate can be found under sparsity constraints. The consistency of the averaged estimate for the true parameter can be established under quite general conditions. The algorithm is illustrated by using high dimensional Gaussian graphical models, high dimensional variable selection and a random-coefficient model.
Keywords:
Expectation-maximization algorithm
Gaussian graphical model
Gibbs sampler
Imputation consistency
Random-coefficient model
Variable selection
Journal
J
IF:
3.6
Papers:
1.5K
Citations:
3.2W
Organization
View more organizations