Convergence and Loss Bounds for Bayesian Sequence Prediction
Abstract
The probability of observing xt at time t, given past observations x1...xt-1 can be computed with Bayes' rule if the true generating distribution μ of the sequences x1x2x3... is known. If μ is unknown, but known to belong to a class M one can base ones prediction on the Bayes mix defined as a weighted sum of distributions ∈ M. Various convergence results of the mixture posterior t to the true posterior μt are presented. In particular a new (elementary) derivation of the convergence t/μt 1 is provided, which additionally gives the rate of convergence. A general sequence predictor is allowed to choose an action yt based on x1...xt-1 and receives loss xt yt if xt is the next symbol of the sequence. No assumptions are made on the structure of (apart from being bounded) and M. The Bayes-optimal prediction scheme based on mixture and the Bayes-optimal informed prediction scheme μ are defined and the total loss L of is bounded in terms of the total loss Lμ of μ. It is shown that L is bounded for bounded Lμ and L/Lμ 1 for Lμ ∞. Convergence of the instantaneous losses are also proven.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.