Adaptive elastic net penalized high-dimensional quantile regression models with generalized coordinate descent algorithm
摘要
Sparse penalized quantile regression, as an effective tool, not only enables robust variable selection but also provides reliable estimation results in high-dimensional data analysis. High-dimensional data often come with high correlations among variables, posing challenges for analytical methods, which should ideally be able to effectively address this issue. To tackle this problem, this paper proposes an adaptive elastic net penalized quantile regression method (Q-AEnet) that combines the advantages of the quantile loss function and adaptive elastic net penalty. Under certain regularity conditions, the proposed method exhibits the oracle property, which means it can accurately identify the true model, implying that the model can achieve ideal prediction or estimation results based on certain optimality criteria. Furthermore, the asymptotic normal distribution of non-zero coefficients is derived. Additionally, to efficiently compute the adaptive elastic net penalized quantile regression, we use a generalized coordinate descent (GCD) algorithm based on a