Functional Coefficient Cointegration Models Subject to Time–Varying Volatility with an Application to the Purchasing Power Parity

This paper analyses functional coefficient cointegration models with both stationary and non‐stationary covariates, allowing time‐varying (unconditional) volatility of a general form. The conventional kernel weighted least squares (KLS) estimator is subject to potential efficiency loss, and can be improved by an adaptive kernel weighted least squares (AKLS) estimator that adapts to heteroscedasticity of unknown form. The AKLS estimator is shown to be as efficient as the oracle generalized kernel weighted least squares estimator asymptotically, and can achieve significant efficiency gain relative to the KLS estimator in finite samples. An illustrative example is provided by investigating the Purchasing Power Parity hypothesis.     

Asymptotically efficient recursive estimation for incomplete data models using the observed information

For a recursive maximum-likelihood estimator with step lengths decaying as 1/n, an adaptive matrix needs to be incorporated to obtain asymptotic efficiency. Ideally, this matrix should be chosen as the inverse Fisher information matrix, which is usually very difficult to compute for incomplete data models. In this paper we give conditions under which the observed information can be incorporated into the recursive procedure to yield an efficient estimator, and we also investigate the finite sample properties of these estimators by simulation.     

Model selection for hazard rate estimation in presence of censoring

This note presents an estimator of the hazard rate function based on right censored data. A collection of estimators is built from a regression-type contrast, in a general collection of linear models. Then, a penalised model selection procedure provides an estimator which satisfies an oracle inequality. In particular, we can prove that it is adaptive in the minimax sense on Hölder spaces.     

Shrinkage estimation of the linear model with spatial interaction

The linear model with spatial interaction has attracted huge attention in the past several decades. Different from most existing research which focuses on its estimation, we study its variable selection problem using the adaptive lasso. Our results show that the method can identify the true model consistently, and the resulting estimator can be efficient as the oracle estimator which is obtained when the zero coefficients in the model are known. Simulation studies show that the proposed methods perform very well.     

Pre-averaging estimators of the ex-post covariance matrix in noisy diffusion models with non-synchronous data

We show how pre-averaging can be applied to the problem of measuring the ex-post covariance of financial asset returns under microstructure noise and non-synchronous trading. A pre-averaged realised covariance is proposed, and we present an asymptotic theory for this new estimator, which can be configured to possess an optimal convergence rate or to ensure positive semi-definite covariance matrix estimates. We also derive a noise-robust Hayashi–Yoshida estimator that can be implemented on the original data without prior alignment of prices. We uncover the finite sample properties of our estimators with simulations and illustrate their practical use on high-frequency equity data.     

Simultaneous selection and weighting of moments in GMM using a trapezoidal kernel

This paper proposes a novel procedure to estimate linear models when the number of instruments is large. At the heart of such models is the need to balance the trade off between attaining asymptotic efficiency, which requires more instruments, and minimizing bias, which is adversely affected by the addition of instruments. Two questions are of central concern: (1) What is the optimal number of instruments to use? (2) Should the instruments receive different weights? This paper contains the following contributions toward resolving these issues. First, I propose a kernel weighted generalized method of moments (GMM) estimator that uses a trapezoidal kernel. This kernel turns out to be attractive to select and weight the number of moments. Second, I derive the higher order mean squared error of the kernel weighted GMM estimator and show that the trapezoidal kernel generates a lower asymptotic variance than regular kernels. Finally, Monte Carlo simulations show that in finite samples the kernel weighted GMM estimator performs on par with other estimators that choose optimal instruments and improves upon a GMM estimator that uses all instruments.     

Model reference adaptive systems applied to regression analyses

The adaptive estimation procedure of model reference adaptive systems is modified and applied to linear models. In general the principle can be used for almost any time series model. Because of the recursive nature of the resulting estimator, it is computationally appealing, especially when a time series is considered as a flow of data. In addition, the estimator turns out to have certain statistical optimality properties.
In the linear regression setting, Ridge estimators turn out to constitute a subclass of the adaptive estimators considered, whereas for unknown measurement variance, the resulting estimators are related to J ames -S tkin type estimators, and have better properties than the latter. The estimator is shown to be strongly consistent and to converge in law to a normal variate under the standard assumptions of linear models. Further it is shown to be admissible and minimax in restricted parameter spaces. The connection between K alman filters and the classical least-squares estimator is also pointed out.     

Kernel-weighted GMM estimators for linear time series models

This paper analyzes the higher-order asymptotic properties of generalized method of moments (GMM) estimators for linear time series models using many lags as instruments. A data-dependent moment selection method based on minimizing the approximate mean squared error is developed. In addition, a new version of the GMM estimator based on kernel-weighted moment conditions is proposed. It is shown that kernel-weighted GMM estimators can reduce the asymptotic bias compared to standard GMM estimators. Kernel weighting also helps to simplify the problem of selecting the optimal number of instruments. A feasible procedure similar to optimal bandwidth selection is proposed for the kernel-weighted GMM estimator.     

Optimal convergence rates,Bahadur representation,and asymptotic normality of partitioning estimators

This paper studies the asymptotic properties of partitioning estimators of the conditional expectation function and its derivatives. Mean-square and uniform convergence rates are established and shown to be optimal under simple and intuitive conditions. The uniform rate explicitly accounts for the effect of moment assumptions, which is useful in semiparametric inference. A general asymptotic integrated mean-square error approximation is obtained and used to derive an optimal plug-in tuning parameter selector. A uniform Bahadur representation is developed for linear functionals of the estimator. Using this representation, asymptotic normality is established, along with consistency of a standard-error estimator. The finite-sample performance of the partitioning estimator is examined and compared to other nonparametric techniques in an extensive simulation study.     

Nonparametric density estimation in compound Poisson processes using convolution power estimators

Consider a compound Poisson process which is discretely observed with sampling interval $\Delta $ until exactly $n$ nonzero increments are obtained. The jump density and the intensity of the Poisson process are unknown. In this paper, we build and study parametric estimators of appropriate functions of the intensity, and an adaptive nonparametric estimator of the jump size density. The latter estimation method relies on nonparametric estimators of $m$ th convolution powers density. The $L^2$ -risk of the adaptive estimator achieves the optimal rate in the minimax sense over Sobolev balls. Numerical simulation results on various jump densities enlight the good performances of the proposed estimator.     

Adaptive estimation with soft thresholding penalties

We show that various robust nonparametric regression estimators, such as the least absolute deviations estimator, can be made adaptive (up to logarithmic factors), by adding a soft thresholding type penalty to the loss function. As an example, we consider the situation where the roughness of the regression function is described by a single parameter p . The theory is complemented with a simulation study.     

Model assisted survey sampling strategy in two phases

Postulating a super-population regression model connecting a size variable, a cheaply measurable variable and an expensively observable variable of interest, an asymptotically optimal double sampling strategy to estimate the survey population total of the third variable is specified. To render it practicable, unknown model-parameters in the optimal estimator are replaced by appropriate statistics. The resulting generalized regression estimator is then shown to have a model-cum-asymptotic design based expected square error equal to that of the asymptotically optimum estimator itself. An estimator for design variance of the estimator is also proposed.     

Optimal inference for instrumental variables regression with non-Gaussian errors

This paper is concerned with inference on the coefficient on the endogenous regressor in a linear instrumental variables model with a single endogenous regressor, nonrandom exogenous regressors and instruments, and i.i.d. errors whose distribution is unknown. It is shown that under mild smoothness conditions on the error distribution it is possible to develop tests which are “nearly” efficient in the sense of Andrews et al. (2006) when identification is weak and consistent and asymptotically optimal when identification is strong. In addition, an estimator is presented which can be used in the usual way to construct valid (indeed, optimal) confidence intervals when identification is strong. The estimator is of the two stage least squares variety and is asymptotically efficient under strong identification whether or not the errors are normal.     

Capture–recapture estimation based upon the geometric distribution allowing for heterogeneity

Capture–Recapture methods aim to estimate the size of an elusive target population. Each member of the target population carries a count of identifications by some identifying mechanism—the number of times it has been identified during the observational period. Only positive counts are observed and inference needs to be based on the observed count distribution. A widely used assumption for the count distribution is a Poisson mixture. If the mixing distribution can be described by an exponential density, the geometric distribution arises as the marginal. This note discusses population size estimation on the basis of the zero-truncated geometric (a geometric again itself). In addition, population heterogeneity is considered for the geometric. Chao’s estimator is developed for the mixture of geometric distributions and provides a lower bound estimator which is valid under arbitrary mixing on the parameter of the geometric. However, Chao’s estimator is also known for its relatively large variance (if compared to the maximum likelihood estimator). Another estimator based on a censored geometric likelihood is suggested which uses the entire sample information but is less affected by model misspecifications. Simulation studies illustrate that the proposed censored estimator comprises a good compromise between the maximum likelihood estimator and Chao’s estimator, e.g. between efficiency and bias.     

Semiparametric efficient adaptive estimation of asymmetric GARCH models

In this paper we derive a semiparametric efficient adaptive estimator of an asymmetric GARCH model. Applying some general results from Drost et al. [1997. The Annals of Statistics 25, 786–818], we first estimate the unknown density function of the disturbances by kernel methods, then apply a one-step Newton–Raphson method to obtain a more efficient estimator than the quasi-maximum likelihood estimator. The proposed semiparametric estimator is adaptive for parameters appearing in the conditional standard deviation model with respect to the unknown distribution of the disturbances.     

On some properties of Markov chain Monte Carlo simulation methods based on the particle filter

Andrieu et al. (2010) prove that Markov chain Monte Carlo samplers still converge to the correct posterior distribution of the model parameters when the likelihood estimated by the particle filter (with a finite number of particles) is used instead of the likelihood. A critical issue for performance is the choice of the number of particles. We add the following contributions. First, we provide analytically derived, practical guidelines on the optimal number of particles to use. Second, we show that a fully adapted auxiliary particle filter is unbiased and can drastically decrease computing time compared to a standard particle filter. Third, we introduce a new estimator of the likelihood based on the output of the auxiliary particle filter and use the framework of Del Moral (2004) to provide a direct proof of the unbiasedness of the estimator. Fourth, we show that the results in the article apply more generally to Markov chain Monte Carlo sampling schemes with the likelihood estimated in an unbiased manner.     

Adaptive algorithms for maximizing overall stock return

Deciding which stocks to purchase and how to optimally allocate the total investment among them is a nontrivial task for every investor. In this article, we propose two adaptive techniques that would provide an optimal allocation maximizing the return over the investment period. The first approach is the adaptive power method (PM) which is a modification of the proper orthogonal decomposition method. The adaptive PM uses only the currently available information to compute the optimal allocations, yet its long-term solution approaches the dominant eigen solution, even though that solution would require having a priori knowledge of all stocks’ performance. The second approach is derived from the well-known Least Mean Square (LMS) method, where the optimal allocation can be computed by adaptively steering the overall return toward a desired value. The experimental results have indicated promising gains even when the general market trend is downward.     

Estimation of conditional moment restrictions without assuming parameter identifiability in the implied unconditional moments

A well-known difficulty in estimating conditional moment restrictions is that the parameters of interest need not be globally identified by the implied unconditional moments. In this paper, we propose an approach to constructing a continuum of unconditional moments that can ensure parameter identifiability. These unconditional moments depend on the “instruments” generated from a “generically comprehensively revealing” function, and they are further projected along the exponential Fourier series. The objective function is based on the resulting Fourier coefficients, from which an estimator can be easily computed. A novel feature of our method is that the full continuum of unconditional moments is incorporated into each Fourier coefficient. We show that, when the number of Fourier coefficients in the objective function grows at a proper rate, the proposed estimator is consistent and asymptotically normally distributed. An efficient estimator is also readily obtained via the conventional two-step GMM method. Our simulations confirm that the proposed estimator compares favorably with that of Domínguez and Lobato (2004, Econometrica) in terms of bias, standard error, and mean squared error.     

On kernel nonparametric regression designed for complex survey data

In this article, we consider nonparametric regression analysis between two variables when data are sampled through a complex survey. While nonparametric regression analysis has been widely used with data that may be assumed to be generated from independently and identically distributed (iid) random variables, the methods and asymptotic analyses established for iid data need to be extended in the framework of complex survey designs. Local polynomial regression estimators are studied, which include as particular cases design-based versions of the Nadaraya–Watson estimator and of the local linear regression estimator. In this paper, special emphasis is given to the local linear regression estimator. Our estimators incorporate both the sampling weights and the kernel weights. We derive the asymptotic mean squared error (MSE) of the kernel estimators using a combined inference framework, and as a corollary consistency of the estimators is deduced. Selection of a bandwidth is necessary for the resulting estimators; an optimal bandwidth can be determined, according to the MSE criterion in the combined mode of inference. Simulation experiments are conducted to illustrate the proposed methodology and an application with the Canadian survey of labour and income dynamics is presented.     

Variable selection and parameter estimation for partially linear models via Dantzig selector

Variable selection plays an important role in the high dimensionality data analysis, the Dantzig selector performs variable selection and model fitting for linear and generalized linear models. In this paper we focus on variable selection and parametric estimation for partially linear models via the Dantzig selector. Large sample asymptotic properties of the Dantzig selector estimator are studied when sample size n tends to infinity while p is fixed. We see that the Dantzig selector might not be consistent. To remedy this drawback, we take the adaptive Dantzig selector motivated by Dicker and Lin (submitted). Moreover, we obtain that the adaptive Dantzig selector estimator for the parametric component of partially linear models has the oracle properties under some appropriate conditions. As generalizations of the Dantzig selector, both the adaptive Dantzig selector and the Dantzig selector optimization can be implemented by the efficient algorithm DASSO proposed by James et al. (J R Stat Soc Ser B 71:127–142, 2009). Choices of tuning parameter and bandwidth are also discussed.