Memory-Universal Prediction of Stationary Random Processes

Paper

01 Dec 1998

Abstract

We consider the problem of one-step-ahead prediction of a real-valued, stationary, strongly mixing random process {Xi}f. The best mean-square predictor of Xo is its conditional mean given the entire infinite past {A";}jl}_00. Given a sequence of observations X\ X-z XN, we propose estimators for the conditional mean based on sequences of parametric models of increasing memory and of increasing dimension, for example, neural networks and Legendre polynomials. The proposed estimators select both the model memory and the model dimension, in a data-driven fashion, by minimizing certain complexity regularized least squares criteria. When the underlying predictor function has a finite memory, we establish that the proposed estimators are memory-universal: the proposed estimators, which do not know the true memory, deliver the same statistical performance (rates of integrated mean-squared error) as that delivered by estimators that know the true memory. Furthermore, when the underlying predictor function does not have a finite memory, we establish that the estimator based on Legendre polynomials is consistent. Index Terms-Bernstein inequality, complexity regularization, least-squares loss, Legendre polynomials, Markov processes, memory-universal prediction, mixing processes, model selection, neural networks, time series prediction. © 1998 IEEE.

Paper