Mathematics – Statistics Theory
Scientific paper
2010-09-10
Mathematics
Statistics Theory
42 pages, submitted to the Annals of Statistics
Scientific paper
A common practice in obtaining a semiparametric efficient estimate is through iteratively maximizing the (penalized) log-likelihood w.r.t. its Euclidean parameter and functional nuisance parameter via Newton-Raphson algorithm. The purpose of this paper is to provide a formula in calculating the minimal number of iterations $k^\ast$ needed to produce an efficient estimate $\hat\theta_n^{(k^\ast)}$ from a theoretical point of view. We discover that (a) $k^\ast$ depends on the convergence rates of the initial estimate and nuisance estimate; (b) more than $k^\ast$ iterations, i.e., $k$, will only improve the higher order asymptotic efficiency of $\hat\theta_n^{(k)}$; (c) $k^\ast$ iterations are also sufficient for recovering the estimation sparsity in high dimensional data. These general conclusions hold, in particular, when the nuisance parameter is not estimable at root-n rate, and apply to semiparametric models estimated under various regularizations, e.g., kernel or penalized estimation. This paper provides a first general theoretical justification for the "one-/two-step iteration" phenomena observed in the literature, and may be useful in reducing the bootstrap computational cost for the semiparametric models.
No associations
LandOfFree
How Many Iterations are Sufficient for Semiparametric Estimation? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with How Many Iterations are Sufficient for Semiparametric Estimation?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How Many Iterations are Sufficient for Semiparametric Estimation? will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-562352