A New Extended BIC and Sequential Lasso Regression Analysis and Their Application in Classification
- 1 Department of Mathematics, College of Science, Shanghai University, Shanghai, China
- 2 Department of Mathematics, College of Science, Shanghai University, Shanghai, China
Abstract
In this paper, firstly, we propose a new method for choosing regularization parameter λ for lasso regression, which differs from traditional method such as multifold cross-validation, our new method gives the maximum value of parameter λ directly. Secondly, by considering another prior form over model space in the Bayes approach, we propose a new extended Bayes information criterion family, and under some mild condition, our new EBIC (NEBIC) is shown to be consistent. Then we apply our new method to choose parameter for sequential lasso regression which selects features by sequentially solving partially penalized least squares problems where the features selected in earlier steps are not penalized in the subsequent steps. Then sequential lasso uses NEBIC as the stopping rule. Finally, we apply our algorithm to identify the nonzero entries of precision matrix for high-dimensional linear discrimination analysis. Simulation results demonstrate that our algorithm has a lower misclassification rate and less computation time than its competing methods under considerations.
- Desboulets, L.D.D. (2018) A Review on Variable Selection in Regression Analysis. Econometrics, 6, Article 45. https://doi.org/10.3390/econometrics6040045
- Fan, J. and Li, R. (2001) Variable Selection via Nonconcave Penalized Likelihood and Its Oracle Properties. Journal of the American Statistical Association, 96, 1348-1360. https://doi.org/10.1198/016214501753382273
- Zou, H. (2012) The Adaptive Lasso and Its Oracle Properties. Journal of the American Statistical Association, 101, 1418-1429. https://doi.org/10.1198/016214506000000735
- Zhang, C. (2010) Nearly Unbiased Variable Selection under Minimax Concave Penalty. The Annals of Statistics, 38, 894-942. https://doi.org/10.1214/09-AOS729
- Tropp, J.A. (2004) Greed Is Good: Algorithmic Results for Sparse Approximation. IEEE Transactions on Information Theory, 50, 2231-2242. https://doi.org/10.1109/TIT.2004.834793
- Efron, B., Hastie, T., Johnstone, I. and Tibshirani, R. (2004) Least Angle Regression. The Annals of Statistics, 32, 407-499. https://doi.org/10.1214/009053604000000067
- Luo, S. and Chen, Z. (2020) A Procedure of Linear Discrimination Analysis with Detected Sparsity Structure for High-Dimensional Multi-Class Classification. Journal of Multivariate Analysis, 179, Article ID: 104641. https://doi.org/10.1016/j.jmva.2020.104641
- Luo, S. and Chen, Z. (2014) Edge Detection in Sparse Gaussian Graphical Models. Computational Statistics & Data Analysis, 70, 138-152. https://doi.org/10.1016/j.csda.2013.09.002
- Chen, Z. and Jiang, Y. (2020) A Two-Stage Sequential Conditional Selection Approach to Sparse High-Dimensional Multivariate Regression Models. Annals of the Institute of Statistical Mathematics, 72, 65-90. https://doi.org/10.1007/s10463-018-0686-5
- Chen, J. and Chen, Z. (2008) Extended Bayesian Information Criteria for Model Selection with Large Model Spaces. Biometrika, 95, 759-771. https://doi.org/10.1093/biomet/asn034
- Bickel, P.J. and Levina, E. (2004) Some Theory for Fisher’s Linear Discriminant Function, ‘Naive Bayes’, and Some Alternatives When There Are Many More Variables than Observations. Bernoulli, 10, 989-1010. https://doi.org/10.3150/bj/1106314847
- Fan, J. and Fan, Y. (2008) High Dimensional Classification Using Features Annealed Independence Rules. Annals of Statistics, 36, 2605-2637. https://doi.org/10.1214/07-AOS504
- Luo, S. and Chen, Z. (2013) Extended BIC for Linear Regression Models with Diverging Number of Relevant Features and High or Ultra-High Feature Spaces. Journal of Statistical Planning and Inference, 143, 494-504. https://doi.org/10.1016/j.jspi.2012.08.015