How many iterations are sufficient for efficient semiparametric estimation?

From MaRDI portal
Publication:2852630

DOI10.1002/SJOS.12005zbMATH Open1364.62077arXiv1009.2111OpenAlexW1601848613MaRDI QIDQ2852630FDOQ2852630


Authors: Guang Cheng Edit this on Wikidata


Publication date: 9 October 2013

Published in: Scandinavian Journal of Statistics (Search for Journal in Brave)

Abstract: 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 kast needed to produce an efficient estimate hathetan(kast) from a theoretical point of view. We discover that (a) kast depends on the convergence rates of the initial estimate and nuisance estimate; (b) more than kast iterations, i.e., k, will only improve the higher order asymptotic efficiency of hathetan(k); (c) kast 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.


Full work available at URL: https://arxiv.org/abs/1009.2111




Recommendations




Cites Work


Cited In (3)





This page was built for publication: How many iterations are sufficient for efficient semiparametric estimation?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2852630)