Local quasilikelihood estimation is a useful extension of local least squares methods, but its computational cost and algorithmic convergence problems make the procedure less appealing, particularly when it is iteratively used in methods such as the backfitting algorithm, crossvalidation and bootstrapping. A onestep local quasilikelihood estimator is introduced to overcome the computational drawbacks of the local quasilikelihood method. We demonstrate that as long as the initial estimators are reasonably good, the onestep estimator has the same asymptotic behaviour as the local quasilikelihood method. Our simulation shows that the onestep estimator performs at least as well as the local quasilikelihood method for a wide range of choices of bandwidths. A datadriven bandwidth selector is proposed for the onestep estimator based on the preasymptotic substitution method of Fan and Gijbels. It is