Weakly convergent nonparametric forecasting of stationary time series

The conditional distribution of the next outcome given the infinite past of a stationary process can be inferred from finite but growing segments of the past. Several schemes are known for constructing pointwise consistent estimates, but they all demand prohibitive amounts of input data. We consider real-valued time series and construct conditional distribution estimates that make much more efficient use of the input data. The estimates are consistent in a weak sense, and the question whether they are pointwise-consistent is still open. For finite-alphabet processes one may rely on a universal data compression scheme like the Lempel-Ziv (1978) algorithm to construct conditional probability mass function estimates that are consistent in expected information divergence. Consistency in this strong sense cannot be attained in a universal sense for all stationary processes with values in an infinite alphabet, but weak consistency can. Some applications of the estimates to on-line forecasting, regression, and classification are discussed.

[1]  M. Kac On the notion of recurrence in discrete stochastic processes , 1947 .

[2]  L. Breiman The Individual Ergodic Theorem of Information Theory , 1957 .

[3]  Amiel Feinstein,et al.  Information and information stability of random variables and processes , 1964 .

[4]  Kazuoki Azuma WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .

[5]  Abraham Lempel,et al.  Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[6]  D. Ornstein Guessing the next output of a stationary process , 1978 .

[7]  Albert Perez On Shannon-McMillan's limit theorem for pairs of stationary random processes , 1980, Kybernetika.

[8]  B. Scarpellini Conditional expectations of stationary processes , 1981 .

[9]  Glen G. Langdon,et al.  Universal modeling and coding , 1981, IEEE Trans. Inf. Theory.

[10]  Glen G. Langdon,et al.  A note on the Ziv-Lempel model for compressing individual sequences , 1983, IEEE Trans. Inf. Theory.

[11]  J. Rissanen Stochastic Complexity and Modeling , 1986 .

[12]  A. Barron ENTROPY AND THE CENTRAL LIMIT THEOREM , 1986 .

[13]  T. Cover,et al.  Asymptotic optimality and asymptotic equipartition properties of log-optimum investment , 1988 .

[14]  Frans M. J. Willems,et al.  Universal data compression and repetition times , 1989, IEEE Trans. Inf. Theory.

[15]  Wolfgang Härdle,et al.  Nonparametric Curve Estimation from Time Series , 1989 .

[16]  Aaron D. Wyner,et al.  Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression , 1989, IEEE Trans. Inf. Theory.

[17]  D. Ornstein,et al.  Universal Almost Sure Data Compression , 1990 .

[18]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[19]  P. Algoet UNIVERSAL SCHEMES FOR PREDICTION, GAMBLING AND PORTFOLIO SELECTION' , 1992 .

[20]  Neri Merhav,et al.  Universal prediction of individual sequences , 1992, IEEE Trans. Inf. Theory.

[21]  László Györfi,et al.  Distribution estimation consistent in total variation and in two types of information divergence , 1992, IEEE Trans. Inf. Theory.

[22]  Benjamin Weiss,et al.  Entropy and data compression schemes , 1993, IEEE Trans. Inf. Theory.

[23]  K. Marton,et al.  Entropy and the Consistent Estimation of Joint Distributions , 1993, Proceedings. IEEE International Symposium on Information Theory.

[24]  P. Shields Universal Redundancy Rates Don't Exist , 1993, Proceedings. IEEE International Symposium on Information Theory.

[25]  Paul C. Shields,et al.  Universal redundancy rates do not exist , 1993, IEEE Trans. Inf. Theory.

[26]  Paul H. Algoet,et al.  The strong law of large numbers for sequential decisions under uncertainty , 1994, IEEE Trans. Inf. Theory.

[27]  László Györfi,et al.  There is no universal source code for an infinite source alphabet , 1994, IEEE Trans. Inf. Theory.

[28]  S. Yakowitz,et al.  An algorithm for nonparametric forecasting for ergodic, stationary time series , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[29]  Abraham Lempel,et al.  On ternary complementary sequences , 1994, IEEE Trans. Inf. Theory.