We revisit the Kolmogorov-Smirnov and Cramér-von Mises goodness-of-fit (GoF) tests and propose a generalization to identically distributed, but dependent uni-variate random variables. We show that the dependence leads to a reduction of the "effective" number of independent observations. The...

This paper proposes a new combined semiparametric estimator of the conditional variance that takes the product of a parametric estimator and a nonparametric estimator based on machine learning. A popular kernel-based machine learning algorithm, known as the kernel-regularized least squares...

We introduce a new, factor based bootstrap approach which is robust under heteroskedastic error terms for inference in functional coefficient models. Modeling the functional coefficient parametrically, the bootstrap approximation of an F statistic is shown to hold asymptotically. In simulation...

We provide a method for distinguishing long-range dependence from deterministic trends such as structural breaks. The method is based on the comparison of standard log-periodogram regression estimation of the memory parameter with its tapered counterpart. The difference of these estimators...

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is...

In this paper, we develop a new censored quantile instrumental variable (CQIV)estimator and describe its properties and computation. The CQIV estimator combines Powell(1986) censored quantile regression (CQR) to deal semiparametrically with censoring, with a control variable approach to...

This paper develops methodology for nonparametric estimation of a polarization measure due to Anderson (2004) and Anderson, Ge, and Leo (2006) based on kernel estimation techniques. We give the asymptotic distribution theory of our estimator, which in some cases is nonstandard due to a boundary...

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is...

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. We show that...