Central limit theorems for nonparametric estimators with real‐time random variables

In this article, asymptotic theories for nonparametric methods are studied when they are applied to real‐time data. In particular, we derive central limit theorems for nonparametric density and regression estimators. For this we formally introduce a sequence of real‐time random variables indexed by a parameter related to fine gridding of time domain (or fine discretization). Our results show that the impact of fine gridding is greater in the density estimation case in the sense that strong dependence due to fine gridding severely affects the major strength of nonparametric density estimator (or its data‐adaptive property). In addition, we discuss some issues about nonparametric regression model with fine gridding of time domain.     

Tests Based on Simplicial Depth for AR(1) Models With Explosion

We propose outlier a robust and distribution‐free test for the explosive AR(1) model with intercept based on simplicial depth. In this model, simplicial depth reduces to counting the cases where three residuals have alternating signs. The asymptotic distribution of the test statistic is given by a specific Gaussian process. Conditions for the consistency are given, and the power of the test at finite samples is compared with alternative tests. The new test outperforms these tests in the case of skewed errors and outliers. Finally, we apply the method to crack growth data and compare the results with an OLS approach.     

On the Spectral Density of the Wavelet Coefficients of Long‐Memory Time Series with Application to the Log‐Regression Estimation of the Memory Parameter

Abstract. In recent years, methods to estimate the memory parameter using wavelet analysis have gained popularity in many areas of science. Despite its widespread use, a rigorous semi‐parametric asymptotic theory, comparable with the one developed for Fourier methods, is still lacking. In this article, we adapt to the wavelet setting, the classical semi‐parametric framework introduced by Robinson and his co‐authors for estimating the memory parameter of a (possibly) non‐stationary process. Our results apply to a class of wavelets with bounded supports, which include but are not limited to Daubechies wavelets. We derive an explicit expression of the spectral density of the wavelet coefficients and show that it can be approximated, at large scales, by the spectral density of the continuous‐time wavelet coefficients of fractional Brownian motion. We derive an explicit bound for the difference between the spectral densities. As an application, we obtain minimax upper bounds for the log‐scale regression estimator of the memory parameter for a Gaussian process and we derive an explicit expression of its asymptotic variance.     

Robust estimators under semi‐parametric partly linear autoregression: Asymptotic behaviour and bandwidth selection

Abstract. In this article, under a semi‐parametric partly linear autoregression model, a family of robust estimators for the autoregression parameter and the autoregression function is studied. The proposed estimators are based on a three‐step procedure, in which robust regression estimators and robust smoothing techniques are combined. Asymptotic results on the autoregression estimators are derived. Besides combining robust procedures with M‐smoothers, predicted values for the series and detection residuals, which allow to detect anomalous data, are introduced. Robust cross‐validation methods to select the smoothing parameter are presented as an alternative to the classical ones, which are sensitive to outlying observations. A Monte Carlo study is conducted to compare the performance of the proposed criteria. Finally, the asymptotic distribution of the autoregression parameter estimator is stated uniformly over the smoothing parameter.     

Wasserstein autoregressive models for density time series

Data consisting of time-indexed distributions of cross-sectional or intraday returns have been extensively studied in finance, and provide one example in which the data atoms consist of serially dependent probability distributions. Motivated by such data, we propose an autoregressive model for density time series by exploiting the tangent space structure on the space of distributions that is induced by the Wasserstein metric. The densities themselves are not assumed to have any specific parametric form, leading to flexible forecasting of future unobserved densities. The main estimation targets in the order-p Wasserstein autoregressive model are Wasserstein autocorrelations and the vector-valued autoregressive parameter. We propose suitable estimators and establish their asymptotic normality, which is verified in a simulation study. The new order-p Wasserstein autoregressive model leads to a prediction algorithm, which includes a data driven order selection procedure. Its performance is compared to existing prediction procedures via application to four financial return data sets, where a variety of metrics are used to quantify forecasting accuracy. For most metrics, the proposed model outperforms existing methods in two of the data sets, while the best empirical performance in the other two data sets is attained by existing methods based on functional transformations of the densities.     

Tests for the Equality of Two Processes' Spectral Densities with Unequal Lengths Using Wavelet Methods

Testing procedures for assessing whether two stationary and independent linear processes with unequal lengths have the same spectral densities or same auto‐covariance functions are investigated. New test statistics are proposed based on the difference of the two wavelet‐based estimates of the two spectral densities. The asymptotic normal distributions of the empirical wavelet coefficients are derived based on Bartlett type approximation of a quadratic form with dependent variables by the corresponding quadratic form with independent and identically distributed (i.i.d.) random variables. The limit distributions of the proposed test statistics are derived from those asymptotic results, and they asymptotically follow known chi‐square distributions. The advantage of those new procedures is that those test statistics are constructed very simply and can be used for two time series with arbitrary lengths. The performance of those new tests is compared with some recent test statistics, with respect to their exact levels and powers. Simulation studies show that our proposed tests are very comparable to the current tests.     

Semiparametric Estimation in Time‐Series Regression with Long‐Range Dependence

Abstract. We consider semiparametric estimation in time‐series regression in the presence of long‐range dependence in both the errors and the stochastic regressors. A central limit theorem is established for a class of semiparametric frequency domain‐weighted least squares estimates, which includes both narrow‐band ordinary least squares and narrow‐band generalized least squares as special cases. The estimates are semiparametric in the sense that focus is on the neighbourhood of the origin, and only periodogram ordinates in a degenerating band around the origin are used. This setting differs from earlier studies on time‐series regression with long‐range dependence, where a fully parametric approach has been employed. The generalized least squares estimate is infeasible when the degree of long‐range dependence is unknown and must be estimated in an initial step. In that case, we show that a feasible estimate which has the same asymptotic properties as the infeasible estimate, exists. By Monte Carlo simulation, we evaluate the finite‐sample performance of the generalized least squares estimate and the feasible estimate.     

Wavelet change‐point estimation for long memory non‐parametric random design models

For a random design regression model with long memory design and long memory errors, we consider the problem of detecting a change point for sharp cusp or jump discontinuity in the regression function. Using the wavelet methods, we obtain estimators for the change point, the jump size and the regression function. The strong consistencies of these estimators are given in terms of convergence rates.     

SIGNIFICANT VARIABLE SELECTION AND AUTOREGRESSIVE ORDER DETERMINATION FOR TIME‐SERIES PARTIALLY LINEAR MODELS

This paper is concerned with the regression coefficient and autoregressive order shrinkage and selection via the smoothly clipped absolute deviation (SCAD) penalty for a partially linear model with time‐series errors. By combining the profile semi‐parametric least squares method and SCAD penalty technique, a new penalized estimation for the regression and autoregressive parameters in the model is proposed. We show that the asymptotic property of the resultant estimator is the same as if the order of autoregressive error structure and non‐zero regression coefficients are known in advance, thus achieving the oracle property in the sense of Fan and Li (2001). In addition, based on a prewhitening technique, we construct a two‐stage local linear estimator (TSLLE) for the non‐parametric component. It is shown that the TSLLE is more asymtotically efficient than the one that ignores the autoregressive time‐series error structure. Some simulation studies are conducted to illustrate the finite sample performance of the proposed procedure. An example of application on electricity usage data is also illustrated. Copyright © 2014 Wiley Publishing Ltd     

A Robbins–Monro Algorithm for Non‐Parametric Estimation of NAR Process with Markov Switching: Consistency

We approach the problem of non‐parametric estimation for autoregressive Markov switching processes. In this context, the Nadaraya–Watson‐type regression functions estimator is interpreted as a solution of a local weighted least‐square problem, which does not admit a closed‐form solution in the case of hidden Markov switching. We introduce a non‐parametric recursive algorithm to approximate the estimator. Our algorithm restores the missing data by means of a Monte Carlo step and estimates the regression function via a Robbins–Monro step. We prove that non‐parametric autoregressive models with Markov switching are identifiable when the hidden Markov process has a finite state space. Consistency of the estimator is proved using the strong α‐mixing property of the model. Finally, we present some simulations illustrating the performances of our non‐parametric estimation procedure.     

Assessing Time‐Reversibility Under Minimal Assumptions

Abstract. This article considers a simple procedure for assessing whether a weakly dependent univariate stochastic process is time‐reversible. Our approach is based on a simple index of the deviation from zero of the median of the one‐dimensional marginal law of differenced data. An attractive feature of the method is that it requires no moment assumptions. Instead of relying on Gaussian asymptotic approximations, we consider using subsampling and resampling methods to construct confidence intervals for the time‐reversibility parameter, and show that such inference procedures are asymptotically valid under a mild mixing condition. The small‐sample properties of the proposed procedures are examined by means of Monte Carlo experiments and an application to real‐world data is also presented.     

On geometric ergodicity of CHARME models

In this article we consider a CHARME model, a class of generalized mixture of nonlinear nonparametric AR‐ARCH time series. To provide sets of conditions under which such processes are geometrically ergodic and, therefore, satisfy some mixing conditions, we apply the theory of Markov chains to derive asymptotic stability of this model. These results form the basis for deriving an asymptotic theory for nonparametric estimation. As an illustration, neural network sieve estimates for the autoregressive and volatility functions are considered, and consistency of the parameter estimates is obtained.     

Bootstrapping confidence intervals for the change‐point of time series

Abstract. We study an at‐most‐one‐change time‐series model with an abrupt change in the mean and dependent errors that fulfil certain mixing conditions. We obtain confidence intervals for the unknown change‐point via bootstrapping methods. Precisely, we use a block bootstrap of the estimated centred error sequence. Then, we reconstruct a sequence with a change in the mean using the same estimators as before. The difference between the change‐point estimator of the resampled sequence and the one of the original sequence can be used as an approximation of the difference between the real change‐point and its estimator. This enables us to construct confidence intervals using the empirical distribution of the resampled time series. A simulation study shows that the resampled confidence intervals are usually closer to their target levels and at the same time smaller than the asymptotic intervals.     

Parameter Estimation for Periodically Stationary Time Series

Abstract. The innovations algorithm can be used to obtain parameter estimates for periodically stationary time series models. In this paper, we compute the asymptotic distribution for these estimates in the case, where the innovations have a finite fourth moment. These asymptotic results are useful to determine which model parameters are significant. In the process, we also develop asymptotics for the Yule–Walker estimates.     

A PARAMETER‐DRIVEN LOGIT REGRESSION MODEL FOR BINARY TIME SERIES

We consider a parameter‐driven regression model for binary time series, where serial dependence is introduced by an autocorrelated latent process incorporated into the logit link function. Unlike in the case of parameter‐driven Poisson log‐linear or negative binomial logit regression model studied in the literature for time series of counts, generalized linear model (GLM) estimation of the regression coefficient vector, which suppresses the latent process and maximizes the corresponding pseudo‐likelihood, cannot produce a consistent estimator. As a remedial measure, in this article, we propose a modified GLM estimation procedure and show that the resulting estimator is consistent and asymptotically normal. Moreover, we develop two procedures for estimating the asymptotic covariance matrix of the estimator and establish their consistency property. Simulation studies are conducted to evaluate the finite‐sample performance of the proposed procedures. An empirical example is also presented.     

On detecting the optimal structure of a neural network under strong statistical features in errors

The purpose of this article is to investigate the empirical performance of various statistical techniques for detecting the optimal structure of a neural network (NN) regression model. We are particularly concerned with the specification of the NN architecture when the error component is characterized by special statistical properties, such as heteroskedasticity and non‐normality. We consider the sequential testing procedure based on standard Lagrange multiplier (LM) tests for neglected nonlinearity and also examine three modifications of this test that are robust to heteroskedasticity. By means of Monte Carlo simulations, we investigate the ability of these procedures to detect the right structure of the NN under different types of heteroskedasticity and noise distributions. Simulation results show that robustified LM tests allow the researcher to control the complexity of the NN without having to explicitly model all statistical aspects of the data‐generating process, something which is not generally feasible with the standard LM test. The combination of robust regression‐based testing with bootstrapping and generalized autoregressive conditional heteroskedasticity modelling techniques increases the efficiency of the statistical sequential procedure in eliciting the optimal NN architecture.     

On residual empirical processes of GARCH‐SM models: application to conditional symmetry tests

Abstract. Considering the generalized autoregressive conditionally heteroskedastic with stochastic mean (GARCH‐SM) model, we establish in this article the consistency and the weak representation of a functional of its residual empirical process. Based on this result, a symmetry test for GARCH‐SM model is developed. Simulations are given to show the asymptotic behaviour and normality of the test statistic.     

Analysis of accumulated rounding errors in autoregressive processes

In considering the rounding impact of an autoregressive (AR) process, there are two different models available to be considered. The first assumes that the dynamic system follows an underlying AR model and only the observations are rounded up to a certain precision. The second assumes that the updated observation is a rounded version of an autoregression on previous rounded observations. This article considers the second model and examines behaviour of rounding impacts to the statistical inferences. The conditional maximum‐likelihood estimates for the model are proposed and their asymptotic properties are established, including strong consistency and asymptotic normality. Furthermore, both the classical AR model and the ordinary rounded AR model are no longer reliable when dealing with accumulated rounding errors. The three models are also applied to fit the Ocean Wave data. It turns out that the estimates under distinct models are significantly different. Based on our findings, we strongly recommend that models for dealing with rounded data should be in accordance with the actions of rounding errors.     

A Generalized Portmanteau Test For Independence Of Two Infinite‐Order Vector Autoregressive Series

Abstract. In many situations, we want to verify the existence of a relationship between multivariate time series. Here, we propose a semiparametric approach for testing the independence between two infinite‐order vector autoregressive (VAR(∞)) series, which is an extension of Hong's [Biometrika (1996c) vol. 83, 615–625] univariate results. We first filter each series by a finite‐order autoregression and the test statistic is a standardized version of a weighted sum of quadratic forms in the residual cross‐correlation matrices at all possible lags. The weights depend on a kernel function and on a truncation parameter. Using a result of Lewis and Reinsel [Journal of Multivariate Analysis (1985) Vol. 16, pp. 393–411], the asymptotic distribution of the test statistic is derived under the null hypothesis and its consistency is also established for a fixed alternative of serial cross‐correlation of unknown form. Apart from standardization factors, the multivariate portmanteau statistic proposed by Bouhaddioui and Roy [Statistics and Probability Letters (2006) vol. 76, pp. 58–68] that takes into account a fixed number of lags can be viewed as a special case by using the truncated uniform kernel. However, many kernels lead to a greater power, as shown in an asymptotic power analysis and by a small simulation study in finite samples. A numerical example with real data is also presented.     

Neural network prediction of cetane number and density of diesel fuel from its chemical composition determined by LC and GC-MS

Neural networks were used to correlate and predict the cetane number and the density of diesel fuel from its chemical composition. Cetane number (CN) and density were correlated with 12 hydrocarbon groups in diesel fuel determined by liquid chromatography (LC) and gas chromatography-mass spectrometry (GC-MS). In total, 69 diesel fuels were available for this study: 48 diesel fuels were included in the training data set and 21 in the test data set. Various neural network architectures were trained using the training data set, and the accuracy of the model obtained was examined by using the test data set. For correlating both CN and density in this study, the best neural network architecture was a general regression neural network (GRNN). With the test data set, the mean absolute errors were 1.23 (CN) and 0.002 g/cm³ for the CN and density, respectively. Predictive equations for CN and density of diesel fuel from its chemical composition were also developed with a standard multiple linear regression method. The comparison of the neural network method with the multiple linear regression method, using this data set, revealed that for complex nonlinear problems such as the correlation of the CN with the hydrocarbon type characterization, the neural network approach could provide a better model. However, for a simpler correlation problem like the density of a diesel fuel, which is approximated well by the sum of the contributions of individual components, the predictive equations produced by multiple linear regression and neural network methods gave similar results.