C.5 Abstractions: Participant Guide

Why do we care about abstractions?

The pointers problem

Open questions about natural abstractions

Prerequisites

Information theory refresher
Bayesian networks refresher
Category theory: universal properties (optional)

Natural Latents

Reading: Abstractions as redundant information

Reading: The minimal latents approach

Reading: Natural latents — the concepts

Deeper dive: Bayes net algebra

Exercises: Natural latents

Exercise 1: Mediation error as conditional total correlation

Exercise 2: Redundancy and the Pareto frontier of naturality

Exercise 3: Minimal mediators, maximal redunds, and uniqueness

Hint: Exercise 1(a)

Condensation

Reading: Condensation

Exercises: Condensation and natural latents

Exercise 1: Weak natural latents from condensation

Exercise 2: Weak redundancy

Exercise 3: Strong natural latents

Exercise 4: Natural latents yield condensations

Exercise 5: Hierarchical natural latent models

Hint: Exercise 1(a)

Softwareness and Factor Space Models

Reading: Softwareness in the natural world

Reading: Factored space models

Why do deterministic relationships break Bayesian networks?

Further topics

Partial information decomposition
Algorithmic statistics
Renormalization group

Further reading