title: Model-free quantification of time-series predictability.
abstract: This paper provides insight into when, why, and how forecast strategies fail when they are applied to complicated time series. We conjecture that the inherent complexity of real-world time-series data, which results from the dimension, nonlinearity, and nonstationarity of the generating process, as well as from measurement issues such as noise, aggregation, and finite data length, is both empirically quantifiable and directly correlated with predictability. In particular, we argue that redundancy is an effective way to measure complexity and predictive structure in an experimental time series and that weighted permutation entropy is an effective way to estimate that redundancy. To validate these conjectures, we study 120 different time-series data sets. For each time series, we construct predictions using a wide variety of forecast models, then compare the accuracy of the predictions with the permutation entropy of that time series. We use the results to develop a model-free heuristic that can help practitioners recognize when a particular prediction method is not well matched to the task at hand: that is, when the time series has more predictive structure than that method can capture and exploit.
authors.affiliation: Department of Computer Science, University of Colorado at Boulder, Boulder, Colorado 80309, USA.
authors.forename: Joshua
authors.initials: J
authors.lastname: Garland
authors.affiliation: Department of Computer Science, University of Colorado at Boulder, Boulder, Colorado 80309, USA.
authors.forename: Ryan
authors.initials: R
authors.lastname: James
authors.affiliation: Department of Computer Science, University of Colorado at Boulder, Boulder, Colorado 80309, USA and Santa Fe Institute, Santa Fe, New Mexico 87501, USA.
authors.forename: Elizabeth
authors.initials: E
authors.lastname: Bradley