A Blockwise Consistency Method for Parameter Estimation of Complex Models
Open Access
- 1 December 2018
- journal article
- research article
- Published by Springer Nature in Sankhya B
- Vol. 80 (S1) , 179-223
Abstract
The drastic improvement in data collection and acquisition technologies has enabled scientists to collect a great amount of data. With the growing dataset size, typically comes a growing complexity of data structures and of complex models to account for the data structures. How to estimate the parameters of complex models has put a great challenge on current statistical methods. This paper proposes a blockwise consistency approach as a potential solution to the problem, which works by iteratively finding consistent estimates for each block of parameters conditional on the current estimates of the parameters in other blocks. The blockwise consistency approach decomposes the high-dimensional parameter estimation problem into a series of lower-dimensional parameter estimation problems, which often have much simpler structures than the original problem and thus can be easily solved. Moreover, under the framework provided by the blockwise consistency approach, a variety of methods, such as Bayesian and frequentist methods, can be jointly used to achieve a consistent estimator for the original high-dimensional complex model. The blockwise consistency approach is illustrated using high-dimensional linear regression with both univariate and multivariate responses. The results of both problems show that the blockwise consistency approach can provide drastic improvements over the existing methods. Extension of the blockwise consistency approach to many other complex models is straightforward.Keywords
This publication has 47 references indexed in Scilit:
- Statistical inference in massive data setsApplied Stochastic Models in Business and Industry, 2012
- The Cancer Cell Line Encyclopedia enables predictive modelling of anticancer drug sensitivityNature, 2012
- The graphical lasso: New insights and alternativesElectronic Journal of Statistics, 2012
- SparseNet: Coordinate Descent With Nonconvex PenaltiesJournal of the American Statistical Association, 2011
- New Insights and Faster Computations for the Graphical LassoJournal of Computational and Graphical Statistics, 2011
- Nearly unbiased variable selection under minimax concave penaltyThe Annals of Statistics, 2010
- Confirmation of Gene Expression–Based Prediction of Survival in Non–Small Cell Lung CancerClinical Cancer Research, 2008
- Sure Independence Screening for Ultrahigh Dimensional Feature SpaceJournal of the Royal Statistical Society Series B: Statistical Methodology, 2008
- Sparse inverse covariance estimation with the graphical lassoBiostatistics, 2007
- A coordinate gradient descent method for nonsmooth separable minimizationMathematical Programming, 2007