Universal time-series forecasting with mixture predictors
Daniil Ryabko

TL;DR
This work explores the theoretical foundations of universal sequential probability forecasting using mixture predictors, demonstrating their broad applicability and limitations in a general probabilistic framework.
Contribution
It provides a comprehensive theoretical analysis of mixture predictors' universality and limitations in sequential probability forecasting across general settings.
Findings
Mixture predictors are universal in broad probabilistic settings.
Theoretical limits of mixture predictors are identified.
Applicability to practical data scenarios is discussed.
Abstract
This book is devoted to the problem of sequential probability forecasting, that is, predicting the probabilities of the next outcome of a growing sequence of observations given the past. This problem is considered in a very general setting that unifies commonly used probabilistic and non-probabilistic settings, trying to make as few as possible assumptions on the mechanism generating the observations. A common form that arises in various formulations of this problem is that of mixture predictors, which are formed as a combination of a finite or infinite set of other predictors attempting to combine their predictive powers. The main subject of this book are such mixture predictors, and the main results demonstrate the universality of this method in a very general probabilistic setting, but also show some of its limitations. While the problems considered are motivated by practical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
