Implicit profiling estimation for semiparametric models with bundled parameters

Solving semiparametric models can be computationally challenging because the dimension of parameter space may grow large with increasing sample size. Classical Newton’s method becomes quite slow and unstable with an intensive calculation of the large Hessian matrix and its inverse. Iterative methods separately updating parameters for the finite dimensional component and the infinite dimensional component have been developed to speed up single iterations, but they often take more steps until convergence or even sometimes sacrifice estimation precision due to sub-optimal update direction. We propose a computationally efficient implicit profiling algorithm that achieves simultaneously the fast iteration step in iterative methods and the optimal update direction in Newton’s method by profiling out the infinite dimensional component as the function of the finite-dimensional component. We devise a first-order approximation when the profiling function has no explicit analytical form. We show that our implicit profiling method always solves any local quadratic programming problem in two steps. In two numerical experiments under semiparametric transformation models and GARCH-M models, as well as a real application using NTP data, we demonstrated the computational efficiency and statistical precision of our implicit profiling method.