The Annals of Statistics

Recursive estimation of a drifted autoregressive parameter

Eduard Belitser

Source: Ann. Statist. Volume 28, Number 3 (2000), 860-870.

Abstract

Suppose the $X_0,\dots, X_n$ are observations of a one-dimensional stochastic dynamic process described by autoregression equations when the autoregressive parameter is drifted with time, i.e. it is some function of time: $\theta_0,\dots, \theta_n$, with $\theta_k = \theta(k/n)$. The function $\theta(t)$ is assumed to belong a priori to a predetermined nonparametric class of functions satisfying the Lipschitz smoothness condition. At each time point $t$ those observations are accessible which have been obtained during the preceding time interval. A recursive algorithm is proposed to estimate $\theta(t)$.Under some conditions on the model,we derive the rate of convergence of the proposed estimator when the frequencyof observations $n$ tends to infinity.

Primary Subjects: 62M10, 62G20
Secondary Subjects: 60F99
Keywords: Autoregressive model; convergence rate; recursive algorithm

Full-text: Open access

Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.aos/1015952001
Mathematical Reviews number (MathSciNet): MR1792790
Digital Object Identifier: doi:10.1214/aos/1015952001
Zentralblatt MATH identifier: 01828965

References

Brockwell, P. J. and Davis, R. A. (1991). Time Series: Theory and Methods, 2nd ed. Springer, New York.
Mathematical Reviews (MathSciNet): MR92d:62001
Dahlhaus, R. (1997). Fitting time series models to nonstationaryprocesses. Ann. Statist. 25 1-37.
Mathematical Reviews (MathSciNet): MR98b:62168
de la Pe na, V. H. and Gin´e, E. (1999). Decoupling. From Dependence to Independence. Randomly Stopped processes. U-Statistics and Processes. Martingales and Beyond. Springer, New York.
Mathematical Reviews (MathSciNet): MR99k:60044
Dmitrienko, A. A., Konev V. V. and Pergamenshchikov, S. M. (1997). Sequential generalized least squares estimator for an autoregressive parameter. Sequential Anal. 16 25-46.
Mathematical Reviews (MathSciNet): MR98g:62161
Zentralblatt MATH: 0879.62072
Kushner, H. J. and Yin, G. G. (1997). Stochastic Approximation Algorithms and Aplications. Springer, New York.
Leonov, S. L. (1988). Recurrent estimation of autoregression parameters. Automat. Remote Control 49 633-642.
Mathematical Reviews (MathSciNet): MR90f:62288
Ljung, L. (1977). Analysis of recursive stochastic algorithms. IEEE Trans. Autom. Control 22 551-575.
Mathematical Reviews (MathSciNet): MR57:5358
Ljung, L. (1987). System Identification-Theory for the User. Prentice Hall, Englewood Cliffs, NJ.
Ljung, L. and S ¨oderstr ¨om, T. (1983). Theory and Practice of Recursive Identification. MIT Press.
Mathematical Reviews (MathSciNet): MR84k:93002
Nevelson, M. B. and Hasminskii, R. Z. (1973). Stochastic Approximation and Recursive Estimation. Amer. Math. Soc, Providence, RI.
Mathematical Reviews (MathSciNet): MR54:11689
Poznyak, A. S. (1979). Convergence of stochastic approximation algorithms in parameter identification of dynamic systems. Automat. Remote Control 40 1254-1258.
Verulava, Y. S. (1981). Convergence of the stochastic approximation algorithm for estimating the autoregression parameter. Automat. Remote Control 42 943-947.
Mathematical Reviews (MathSciNet): MR83c:62135
Williams, D. (1991). Probability with Martingales. Cambridge Univ. Press.

2009 © Institute of Mathematical Statistics