liveBook · Manning

Randomness deficiency

As explained in Sutskever's List

Randomness deficiency is a measure of how atypical an observed outcome is relative to a model, based on the gap between expected and actual algorithmic complexity.

Randomness deficiency measures how atypical data is under a model: roughly, it is the gap between the outcome’s expected complexity and its actual complexity. Low deficiency suggests the data fits the model; high deficiency marks it as an awkward misfit. In algorithmic statistics, it helps distinguish structure from noise and assess whether a concise model offers a good explanation. section 8.2.1

A black swan

A black swan has high deficiency under the model “all swans are white,” but low deficiency under a model that allows black and white swans. section 8.2.1

How Sutskever's List covers it

How deep it goes
Defines deficiency roughly as a complexity gap and illustrates it, without giving a formal derivation.
Examples
Contrasts a black swan under models that exclude or allow black swans.
What you can do after
Evaluate whether an observation is typical under a model by comparing expected and actual complexity.
How it connects
Connects algorithmic statistics and scientific explanation with Kolmogorov complexity.

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.