mlsanityData to 7 Oct 2026

Bayesian Renormalization

arXiv 2305.10491 ↗First posted 17 May 2023hep-th cond-mat.dis-nn cs.AIcited by 13

Not on the map. Why?

Abstract (arXiv)

In this note we present a fully information theoretic approach to renormalization inspired by Bayesian statistical inference, which we refer to as Bayesian Renormalization. The main insight of Bayesian Renormalization is that the Fisher metric defines a correlation length that plays the role of an emergent RG scale quantifying the distinguishability between nearby points in the space of probability distributions. This RG scale can be interpreted as a proxy for the maximum number of unique observations that can be made about a given system during a statistical inference experiment. The role of the Bayesian Renormalization scheme is subsequently to prepare an effective model for a given system up to a precision which is bounded by the aforementioned scale. In applications of Bayesian Renormalization to physical systems, the emergent information theoretic scale is naturally identified with the maximum energy that can be probed by current experimental apparatus, and thus Bayesian Renormalization coincides with ordinary renormalization. However, Bayesian Renormalization is sufficiently general to apply even in circumstances in which an immediate physical scale is absent, and thus provides an ideal approach to renormalization in data science contexts. To this end, we provide insight into how the Bayesian Renormalization scheme relates to existing methods for data compression and data generation such as the information bottleneck and the diffusion learning paradigm. We conclude by designing an explicit form of Bayesian Renormalization inspired by Wilson's momentum shell renormalization scheme in Quantum Field Theory. We apply this Bayesian Renormalization scheme to a simple Neural Network and verify the sense in which it organizes the parameters of the model according to a hierarchy of information theoretic importance.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 21 of its 103 references that are in the map. First posted on arXiv 17 May 2023.

Builds on

21 of 103 references.

References · 21

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
  3. 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,005
  4. 2022Hierarchical Text-Conditional Image Generation with CLIP Latentscited by 6,539
  5. 2021Zero-Shot Text-to-Image Generationcited by 4,276
  6. 2021Variational Diffusion Modelscited by 1,145
  7. 2021Explaining Neural Scaling Lawscited by 353
  8. 2020Hands-on Bayesian Neural Networks -- a Tutorial for Deep Learning Userscited by 336
  9. 2022Cold Diffusion: Inverting Arbitrary Image Transforms Without Noisecited by 275
  10. 2020A Review on Generative Adversarial Networks: Algorithms, Theory, and Applicationscited by 209
  11. 2016Why does deep and cheap learning work so well?cited by 100
  12. 2018An elementary introduction to information geometrycited by 76
9 more
  1. 2020Neural Networks and Quantum Field Theorycited by 58
  2. 2014An exact mapping between the Variational Renormalization Group and Deep Learningcited by 52
  3. 2021Building Quantum Field Theories Out of Neuronscited by 27
  4. 2021Towards quantifying information flows: relative entropy in deep neural networks and the renormalization groupcited by 12
  5. 2022Decomposing neural networks as mappings of correlation functionscited by 12
  6. 2022The Inverse of Exact Renormalization Group Flows as Statistical Inferencecited by 11
  7. 2022On the Dynamics of Inference and Learningcited by 9
  8. 2018Coarse--graining, fixed points, and scaling in a large population of neuronscited by 4
  9. 2018Coarse--graining and hints of scaling in a population of 1000+ neuronscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 8; 2025: 0; 2026: 4.

13 papers.

Sort:

By area: