Abstract
The Cox model is an exceedingly popular semiparametric hazard regression model for the analysis of time-to-event accompanied by explanatory variables. Within the ultrahigh-dimensional data setting, not like the marginal screening strategy, there is a joint feature screening method based on the partial likelihood of the Cox model but it leaves computational feasibility unsolved. In this paper, we develop an enhanced iterative hard-thresholding algorithm by adapting the non-monotone proximal gradient method under the Cox model. The proposed algorithm is efficient because it is computationally both effective and fast. Meanwhile, our proposed algorithm begins with a LASSO initial estimator rather than the naive zero initial and still enjoys sure screening in theory and further enhances the computational efficiency in practice. We also give a rigorous theory proof. The advantage of our proposed work is demonstrated by numerical studies and illustrated by the diffuse large B-cell lymphoma data example.
| Original language | English |
|---|---|
| Pages (from-to) | 885-910 |
| Number of pages | 26 |
| Journal | Computational Statistics |
| Volume | 36 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Jun 2021 |
Keywords
- Cox’s model
- Joint feature screening
- LASSO initial
- Locally Lipschitz optimization
- Non-monotone proximal gradient
ASJC Scopus subject areas
- Statistics and Probability
- Statistics, Probability and Uncertainty
- Computational Mathematics
Fingerprint
Dive into the research topics of 'An efficient algorithm for joint feature screening in ultrahigh-dimensional Cox’s model'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver