liveBook · Manning

Solomonoff induction

As explained in Sutskever's List

Solomonoff induction predicts observations by assigning greater prior weight to shorter programs that generate them while retaining all computable explanations.

Originating in Ray Solomonoff’s work in the 1960s, Solomonoff induction predicts sequences by combining computable explanations. Each program that generates a pattern contributes probability mass; shorter programs receive more weight. The resulting Bayes mixture keeps multiple explanations in play while favoring simpler ones. section 9.1.2

A shorter program gets more prior weight

With a fair coin assigned to each program bit, a particular 10-bit program has prior weight 2⁻¹⁰, while a 100-bit program has weight 2⁻¹⁰⁰. The longer program receives 2⁻⁹⁰ as much prior weight. section 9.1.2

How Sutskever's List covers it

How deep it goes
Defines program-weighted prediction, illustrates bit-length weighting, and connects it to Bayesian mixtures and minimum description length.
Examples
Compares the prior weights of 10-bit and 100-bit programs under fair-coin sampling.
What you can do after
Understand how program length shapes prior weight and how multiple computable explanations contribute to predictions.
How it connects
Connects inductive inference with Bayesian mixture prediction, minimum description length, Occam’s razor, and Epicurus’s principle.

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.