By Topic

Memory-universal prediction of stationary random processes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Modha, D.S. ; net.Mining, IBM Almaden Res. Center, San Jose, CA, USA ; Masry, E.

We consider the problem of one-step-ahead prediction of a real-valued, stationary, strongly mixing random process (Xi)i=-∞. The best mean-square predictor of X0 is its conditional mean given the entire infinite past (Xi)i=-∞-1. Given a sequence of observations X1, X2, 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

Published in:

Information Theory, IEEE Transactions on  (Volume:44 ,  Issue: 1 )