liveBook · Manning

Coarse-graining

As explained in Sutskever's List

Coarse-graining is the transformation of a fine-grained state into a lower-resolution representation that preserves selected large-scale structure.

As coffee and cream mix, the fine-grained grid becomes speckled and increasingly random. Coarse-graining replaces small neighborhoods with averages, then quantizes those averages into labels such as coffee, cream, and mixed. The resulting macrostate discards microscopic randomness while retaining large-scale structure, such as boundaries and cream filaments. Compressing this array provides an estimate of its description length and apparent complexity. section 8.1.1 section 8.1.1

Coffee and cream mixing

At first, a coarse-grained image shows simple blocks of coffee and cream. Midway through mixing, irregular gray regions reveal local differences in the mixture; later, the image becomes nearly uniform gray. The estimated complexity rises and then falls across these stages, even as entropy steadily increases. Interacting dynamics produce a more structured midpoint and a larger complexity peak than independent diffusion. section 8.1.2 section 8.1.2

Figure 8.2 Illustration of the construction of the coarse-grained array using an example grain size of 3. The values of the shaded cells on the left are averaged to produce the value of the shaded cell on the right. Used with permission granted by the lead author (Scott Aaronson).
figure

Shows how neighborhood values are averaged to form a coarse-grained cell. section 8.1.1

How Sutskever's List covers it

How deep it goes
Works through neighborhood averaging and quantization, then uses compression of the resulting array to estimate macrostate complexity.
Examples
Compares coarse-grained coffee-and-cream patterns in interacting and noninteracting mixing models.
What you can do after
Understand how structured intermediate patterns can appear more complex than either the initial or final mixture.
How it connects
Links coarse-graining to entropy, Kolmogorov complexity, data compression, and cellular automata.

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.