The question

QUESTION-060 asks whether the variables a trained network represents are fixed by its objective or by what its architecture can represent, and when they coincide with the system’s relevant variables. One candidate condition is that the architecture can express the system’s own coarse-graining exactly. This question asks whether that is enough.

The answer

THEORY-197, Active, answers no:

  • The identity. With the RG kernel T = −E + H, Kadanoff’s coarse Hamiltonian equals the RBM’s hidden-marginal Hamiltonian for every parameter value, and an exact RG step is exactly a perfect fit of the data distribution (Mehta and Schwab, Eqs. 18–22).
  • The counterexample. Koch-Janusz and Ringel train an RBM by contrastive divergence on fully packed dimers with added decoupled spin pairs. It spends its hidden units on the noise, then on columnar textures, and not on the staggered patterns that carry the RG-relevant fields.

So a network that can represent the renormalization need not learn it. A negative answer by one counterexample, for Boltzmann machines. When distribution-fitting networks do keep the relevant variables remains QUESTION-060’s.