STAR模型中的递归退势单位根检验研究

在STAR模型框架下,考虑时间序列具有线性确定性趋势成分,本文建立了一个递归退势单位根检验统计量,推导了其渐近分布;并在考虑初始条件情形下,对递归退势、OLS和GLS退势单位根检验统计量的有限样本性质进行了细致的比较研究。若忽略初始条件的影响,GLS退势和递归退势单位根检验统计量的检验势都显著高于OLS退势。随着初始条件的增大,GLS退势单位根检验统计量的检验势下降得比较厉害,递归退势单位根检验统计量的检验势较为稳定,且在样本量较大情形下更具优势。     

Implementation of recursive nonparametric kernel estimation and a monte carlo study on its finite sample properties

The recursive estimator for the conditional mean of a nonparametric regression model with independent observations was thoroughly explored by Ahmad and Lin (1976), and Singh and Ullah (1986). Their studies are mainly concerned with the estimator's asymptotic behaviour. However, they do not include much discussion on the strategy of computing the estimates. In this paper, we provide a convenient implementation of the recursive estimator and examine its finite sample properties through simulation studies. Our study has demonstrated that for relatively short length of recursive updating, the estimates are generally equivalent to their fixed window width counterparts However, we found that substantial recursive updating can seriously lower the estimator's efficiency even though it is a consistent estimator.     

Recursive techniques for the construction of experimental designs

The construction of experimental designs by recursive techniques is studied in this paper. Formulae for the recursive addition or deletion of data from a design are derived for a typical sub-hypothesis situation of a general experimental design. These results are used to consider the recursive construction of experimental designs with respect to different optimality criteria. This approach to the construction of designs is quite different to that of the well-established theory of optimal design.     

Implementation of recursive nonparametric kernel estimation and a monte carlo study on its finite sample properties

The recursive estimator for the conditional mean of a nonparametric regression model with independent observations was thoroughly explored by Ahmad and Lin (1976), and Singh and Ullah (1986). Their studies are mainly concerned with the estimator's asymptotic behaviour. However, they do not include much discussion on the strategy of computing the estimates. In this paper, we provide a convenient implementation of the recursive estimator and examine its finite sample properties through simulation studies. Our study has demonstrated that for relatively short length of recursive updating, the estimates are generally equivalent to their fixed window width counterparts However, we found that substantial recursive updating can seriously lower the estimator's efficiency even though it is a consistent estimator.     

Recursive M-estimators of location

This paper deals with recursive M-estimators of a location parameter θ in stationary processes when scale is regarded as a nuisance parameter. For the nonrecursive M-estimators, the median absolute deviation is a useful estimator of scale. Two recursive variants of the median absolute deviation are proposed and the performance of the resulting recursive estimators is examined in a numerical study.     

The stochastic approximation method for the estimation of a multivariate probability density

We apply the stochastic approximation method to construct a large class of recursive kernel estimators of a probability density, including the one introduced by Hall and Patil [1994. On the efficiency of on-line density estimators. IEEE Trans. Inform. Theory 40, 1504–1512]. We study the properties of these estimators and compare them with Rosenblatt's nonrecursive estimator. It turns out that, for pointwise estimation, it is preferable to use the nonrecursive Rosenblatt's kernel estimator rather than any recursive estimator. A contrario, for estimation by confidence intervals, it is better to use a recursive estimator rather than Rosenblatt's estimator.     

A kind of stochastic recursive Zero-Sum differential game problem with double obstacles constraint

Abstract

This paper concerns a class of stochastic recursive zero-sum differential game problem with recursive utility related to a backward stochastic differential equation (BSDE) with double obstacles. A sufficient condition is provided to obtain the saddle-point strategy under some assumptions. In virtue of the corresponding relationship of doubly reflected BSDE and mixed game problem, a stochastic linear recursive mixed differential game problem is studied to apply our theoretical result, and here the explicit saddle-point strategy as well as the saddle-point stopping time for the mixed game problem are obtained. Besides, a numeral example is also given to demonstrate the result by virtue of partial differential equations (PDEs) computation method.     

Robust recursive estimation in nonlinear time series

Aase (1983) has dealt with recursive estimation in nonlinear time series of autoregressive type including its asymptotic properties. This contribution modifies the results for the case of nonlinear time series with outliers using the principle of M-estimation from robust statistics. Strong consistency of the robust recursive estimates is preserved under corresponding assumptions. Several types of such estimates are compared by means of a numerical simulation.     

Multiple hypothesis test for parameter constancy based on recursive residuals

This article presents a multiple hypothesis test procedure that combines two well known tests for structural change in the linear regression model, the CUSUM test and the recursive t test. The CUSUM test is run through the sequence of recursive residuals as usual; if the CUSUM plot does not violate the critical lines, one more step is taken to perform the t test for hypothesis of zero mean based on all recursive residuals. The asymptotic size of this multiple hypothesis test is derived; power simulation results suggest that it outperforms the traditional CUSUM test and complements other tests that are currently stressed in econometrics.     

Multiple hypothesis test for parameter constancy based on recursive residuals

This article presents a multiple hypothesis test procedure that combines two well known tests for structural change in the linear regression model, the CUSUM test and the recursive t test. The CUSUM test is run through the sequence of recursive residuals as usual; if the CUSUM plot does not violate the critical lines, one more step is taken to perform the t test for hypothesis of zero mean based on all recursive residuals. The asymptotic size of this multiple hypothesis test is derived; power simulation results suggest that it outperforms the traditional CUSUM test and complements other tests that are currently stressed in econometrics.     

The probability distribution and the expected value of a stopping variable associated with one-sided cusum procedures for non-negative integer valued random variables

The structure of a stopping variable N based on one-sided CUSUM procedures is analyzed. Stopping occurs when a Markovian sequence of maxima of partial sums {M } crosses a certain boundary. On the basis of a recursive relationship between the M_n+1 and M_n a recursive equation is derived for the determination of the defective distributions K_n(x) = P{M ≤ x, N ≤n} . This recursive equation yields a recursive algorithm for the determination of P {N > n} . The paper studies the case when the basic random variables are non-negative integers-valued. In these cases the values of P{N > n} and E{N} can be determined by solving proper systems of linear equations.     

Subgroup identification by recursive segmentation

A new modeling approach called ‘recursive segmentation’ is proposed to support the supervised exploration and identification of subgroups or clusters. It is based on the frameworks of recursive partitioning and the Patient Rule Induction Method (PRIM). Through combining these methods, recursive segmentation aims to exploit their respective strengths while reducing their weaknesses. Consequently, recursive segmentation can be applied in a very general way, that is in any (multivariate) regression, classification or survival (time-to-event) problem, using conditional inference, evolutionary learning or the CART algorithm, with predictor variables of any scale and with missing values. Furthermore, results of a synthetic example and a benchmark application study that comprises 26 data sets suggest that recursive segmentation achieves a competitive prediction accuracy and provides more accurate definitions of subgroups by models of less complexity as compared to recursive partitioning and PRIM. An application to the German Breast Cancer Study Group data demonstrates the improved interpretability and reliability of results produced by the new approach. The method is made publicly available through the R-package rseg (http://rseg.r-forge.r-project.org/).     

On the asymptotic behaviour of the recursive Nadaraya–Watson estimator associated with the recursive sliced inverse regression method

We investigate the asymptotic behaviour of the recursive Nadaraya–Watson estimator for the estimation of the regression function in a semiparametric regression model. On the one hand, we make use of the recursive version of the sliced inverse regression method for the estimation of the unknown parameter of the model. On the other hand, we implement a recursive Nadaraya–Watson procedure for the estimation of the regression function which takes into account the previous estimation of the parameter of the semiparametric regression model. We establish the almost sure convergence as well as the asymptotic normality for our Nadaraya–Watson estimate. We also illustrate our semiparametric estimation procedure on simulated data.     

Bandwidth selector for nonparametric recursive density estimation for spatial data defined by stochastic approximation method

Abstract

In this article we propose an automatic selection of the bandwidth of the recursive kernel density estimators for spatial data defined by the stochastic approximation algorithm. We showed that, using the selected bandwidth and the stepsize which minimize the MWISE (Mean Weighted Integrated Squared Error), the recursive estimator will be quite similar to the nonrecursive one in terms of estimation error and much better in terms of computational costs. In addition, we obtain the central limit theorem for the nonparametric recursive density estimator under some mild conditions.     

Recursive online EM estimation of mixture autoregressions

This paper develops a recursive expectation–maximization (REM) algorithm for estimating a mixture autoregression (MAR) with an independent and identically distributed regime transition process. The proposed method, which is useful for long time series as well as for data available in real time, follows a recursive predictor error-type scheme. Based on a slightly modified system to the expectation–maximization (EM) equations for an MAR model, the REM algorithm consists of two steps at each iteration: the expectation step, in which the current unobserved regime transition is estimated from new data using previous recursive estimates, and the minimization step, in which the MAR parameter estimates are recursively updated following a minimization direction. Details of implementation of the REM algorithm are given and its finite-sample performance is shown via simulation experiments. In particular, the EM and REM provide roughly similar estimates, especially for moderate and long time series.     

A recursive approach to parameter estimation in regression and time series models

In this paper we discuss the recursive (or on line) estimation in (i) regression and (ii) autoregressive integrated moving average (ARIMA) time series models. The adopted approach uses Kalman filtering techniques to calculate estimates recursively. This approach is used for the estimation of constant as well as time varying parameters. In the first section of the paper we consider the linear regression model. We discuss recursive estimation both for constant and time varying parameters. For constant parameters, Kalman filtering specializes to recursive least squares. In general, we allow the parameters to vary according to an autoregressive integrated moving average process and update the parameter estimates recursively. Since the stochastic model for the parameter changes will "be rarely known, simplifying assumptions have to be made. In particular we assume a random walk model for the time varying parameters and show how to determine whether the parameters are changing over time. This is illustrated with an example.     

Reml estimation for repeated measures analysis

Models for repeated measures or growth curves consist of a mean response plus error and the errors are usually correlated. Both maximum likelihood and residual maximum likelihood (REML) estimators of a regression model with dependent errors are derived for cases in which the variance matrix of the error model admits a convenient Cholesky factorisation. This factorisation may be linked to methods for producing recursive estimates of the regression parameters and recursive residuals to provide a convenient computational method. The method is used to develop a general approach to repeated measures analysis.     

On the Estimation of the Density of a Directional Data Stream

Many directional data such as wind directions can be collected extremely easily so that experiments typically yield a huge number of data points that are sequentially collected. To deal with such big data, the traditional nonparametric techniques rapidly require a lot of time to be computed and therefore become useless in practice if real time or online forecasts are expected. In this paper, we propose a recursive kernel density estimator for directional data which (i) can be updated extremely easily when a new set of observations is available and (ii) keeps asymptotically the nice features of the traditional kernel density estimator. Our methodology is based on Robbins–Monro stochastic approximations ideas. We show that our estimator outperforms the traditional techniques in terms of computational time while being extremely competitive in terms of efficiency with respect to its competitors in the sequential context considered here. We obtain expressions for its asymptotic bias and variance together with an almost sure convergence rate and an asymptotic normality result. Our technique is illustrated on a wind dataset collected in Spain. A Monte‐Carlo study confirms the nice properties of our recursive estimator with respect to its non‐recursive counterpart.     

Recursive Estimation of GARCH Models

This article develops three recursive on-line algorithms, based on a two-stage least squares scheme for estimating generalized autoregressive conditionally heteroskedastic (GARCH) models. The first one, denoted by 2S-RLS, is an adaptation of the recursive least squares method for estimating autoregressive conditionally heteroskedastic (ARCH) models. The second and the third ones (denoted, respectively, by 2S-PLR and 2S-RML) are adapted versions of the pseudolinear regression (PLR) and the recursive maximum likelihood (RML) methods to the GARCH case. We show that the proposed algorithms give consistent estimators and that the 2S-RLS and the 2S-RML estimators are asymptotically Gaussian. These methods seem very adequate for modeling the sequential feature of financial time series, which are observed on a high-frequency basis. The performance of these algorithms is shown via a simulation study.     

A modified Kolmogorov-Smirnov test for a rectangular distribution with unknown parameters: Computation of the distribution of the test statistic

A recursive scheme for the calculation of the distribution of the test statistic of a modified Kolmogorov-Smirnov-test for a rectangular distribution with unknown parameters is given.