Papers
Topics
Authors
Recent
Search
2000 character limit reached

Limitations on intermittent forecasting

Published 19 Oct 2007 in math.PR, cs.IT, and math.IT | (0710.3773v1)

Abstract: Bailey showed that the general pointwise forecasting for stationary and ergodic time series has a negative solution. However, it is known that for Markov chains the problem can be solved. Morvai showed that there is a stopping time sequence ${\lambda_n}$ such that $P(X_{\lambda_n+1}=1|X_0,...,X_{\lambda_n}) $ can be estimated from samples $(X_0,...,X_{\lambda_n})$ such that the difference between the conditional probability and the estimate vanishes along these stoppping times for all stationary and ergodic binary time series. We will show it is not possible to estimate the above conditional probability along a stopping time sequence for all stationary and ergodic binary time series in a pointwise sense such that if the time series turns out to be a Markov chain, the predictor will predict eventually for all $n$.

Citations (16)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.