liveBook · Manning

Bayes mixture predictor

As explained in Sutskever's List

A Bayes mixture predictor combines predictions from multiple programs or hypotheses by weighting them according to their posterior support.

For binary sequence prediction, the next bit is unknown and programs offer competing predictions. Bayes’ rule increases the weight of programs that predicted the observed history well and decreases the weight of those that did not. section 9.1.2

Instead of following only the most trusted program, the Bayes mixture predictor weights all programs’ predictions by their posterior support. This crowd-of-hypotheses approach sits within a tradition of inductive inference traced to Solomonoff’s work in the 1960s. section 9.1.2

How Sutskever's List covers it

How deep it goes
Explains Bayesian reweighting and weighted voting, contrasting the mixture with choosing a single best-supported program.
Examples
Uses an unknown infinite bit sequence and programs that gain or lose trust as they predict its history.
What you can do after
Understand how posterior support lets multiple programs contribute to a next-bit prediction.
How it connects
Connects the predictor to Bayes’ rule, Solomonoff induction, and inductive inference.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Sutskever's List. The section links point to the parts of the book it draws on.