Local polynomial fitting has many exciting statistical properties which where established under i.i.d. setting. However, the need for nonlinea r time series modeling, constructing predictive intervals, understanding divergence of nonlinear time series requires the development of the theory of local polynomial fitting for dependent data. In this paper, we study the problem of estimating conditional mean functions and their derivatives via a local polynomial fit. The functions include conditional moments, conditional distribution as well as conditional density functions. Joint asymptotic normality for derivative estimation is established for both strongly mixing and mixing processes.

We develop a specification test for the transition density of a discretely-sampled continuous-time diffusion process, based on a comparison of a nonparametric estimate of the transition density or distribution function to their corresponding parametric counterparts assumed by the null hypothesis. We provide a direct comparison of the two densities for an arbitrary specification of the null parametric model using three different discrepancy measures between the null and alternative transition density and distribution functions. We establish the asymptotic null distributions of proposed test statistics and compute their power functions. The finite sample properties are critically investigated via simulation studies and are compared with other tests. Our approaches are illustrated by applications to implied volatility data and Treasury bill data.

Statistical and machine learning theory has developed several conditions ensuring that popular estimators such as the Lasso or the Dantzig selector perform well in high-dimensional sparse regression, including the restricted eigenvalue, compatibility, and q sensitivity properties. However, some of the central aspects of these conditions are not well understood. For instance, it is unknown if these conditions can be checked efficiently on any given dataset. This is problematic, because they are at the core of the theory of sparse regression. Here we provide a rigorous proof that these conditions are NP-hard to check. This shows that the conditions are computationally infeasible to verify, and raises some questions about their practical applications. However, by taking an average-case perspective instead of the worst-case view of NP-hardness, we show that a particular condition, q sensitivity, has certain