Memory Retention and the Classification of Renormalization-Group Fixed Points in Self-Similar Dynamics
arXiv:2607.14388
2026
Architecture
1 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The paper introduces a renormalization-group classification based on whether an initially relevant length scale is erased or remains explicitly encoded in the asymptotic fixed point. Its transferable mechanism is a scale transformation that preserves a latent scale variable rather than forcing all states into a universal, scale-free profile: memory-retaining fixed points take forms such as \(\eta^{\alpha}F(\xi/\eta^{\beta})\). A neural implementation should combine coarse-grained feature processing with an explicit scale state \(\eta\), and train the network to predict how representations transform when the input is rescaled. The key falsifiable test is whether a nonzero learned \(\beta\) and retained-scale model produce lower cross-scale prediction error than a conventional scale-invariant or scale-blind architecture.
Ideas from this paper
✗ Mechanism failed
2026
Replace scale-blind pooling or downsampling with a coarse-graining block that carries an explicit relevant scale variable \(\eta\) alongside the feature field. The block is constrained to represent features in the memory-retaining form \(h(\xi,\eta)=\eta^{\alpha}F(\xi/\eta^{\beta})\), allowing both feature amplitude and profile shape to depend on the scale inherited from the input or previous RG step.
Useful7/10
Difficulty5/10
Novelty6/10