On sparse estimation for semiparametric linear transformation models

Semiparametric linear transformation models have received much attention due to their high flexibility in modeling survival data. A useful estimating equation procedure was recently proposed by Chen et al. (2002)  [21] for linear transformation models to jointly estimate parametric and nonparametric...

Full description

Saved in:
Bibliographic Details
Published inJournal of multivariate analysis Vol. 101; no. 7; pp. 1594 - 1606
Main Authors Zhang, Hao Helen, Lu, Wenbin, Wang, Hansheng
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier Inc 01.08.2010
Elsevier
Taylor & Francis LLC
SeriesJournal of Multivariate Analysis
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Semiparametric linear transformation models have received much attention due to their high flexibility in modeling survival data. A useful estimating equation procedure was recently proposed by Chen et al. (2002)  [21] for linear transformation models to jointly estimate parametric and nonparametric terms. They showed that this procedure can yield a consistent and robust estimator. However, the problem of variable selection for linear transformation models has been less studied, partially because a convenient loss function is not readily available under this context. In this paper, we propose a simple yet powerful approach to achieve both sparse and consistent estimation for linear transformation models. The main idea is to derive a profiled score from the estimating equation of Chen et al.  [21], construct a loss function based on the profile scored and its variance, and then minimize the loss subject to some shrinkage penalty. Under regularity conditions, we have shown that the resulting estimator is consistent for both model estimation and variable selection. Furthermore, the estimated parametric terms are asymptotically normal and can achieve a higher efficiency than that yielded from the estimation equations. For computation, we suggest a one-step approximation algorithm which can take advantage of the LARS and build the entire solution path efficiently. Performance of the new procedure is illustrated through numerous simulations and real examples including one microarray data.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0047-259X
1095-7243
DOI:10.1016/j.jmva.2010.01.015