On the Dynamics of Inference and Learning
Not on the map. Why?
Abstract (arXiv)
Statistical Inference is the process of determining a probability distribution over the space of parameters of a model given a data set. As more data becomes available this probability distribution becomes updated via the application of Bayes' theorem. We present a treatment of this Bayesian updating process as a continuous dynamical system. Statistical inference is then governed by a first order differential equation describing a trajectory or flow in the information geometry determined by a parametric family of models. We solve this equation for some simple models and show that when the Cram'er-Rao bound is saturated the learning rate is governed by a simple 1/T power-law, with T a time-like variable denoting the quantity of data. The presence of hidden variables can be incorporated in this setting, leading to an additional driving term in the resulting flow equation. We illustrate this with both analytic and numerical examples based on Gaussians and Gaussian Random Processes and inference of the coupling constant in the 1D Ising model. Finally we compare the qualitative behaviour exhibited by Bayesian flows to the training of various neural networks on benchmarked data sets such as MNIST and CIFAR10 and show how that for networks exhibiting small final losses the simple power-law is also satisfied.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 9 of its 40 references that are in the map. First posted on arXiv 19 Apr 2022.
Builds on
9 of 40 references.
References · 9
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2021The Principles of Deep Learning Theorycited by 169
- 2018A high-bias, low-variance introduction to Machine Learning for physicistscited by 108
- 2020Neural Networks and Quantum Field Theorycited by 58
- 2021Building Quantum Field Theories Out of Neuronscited by 27
- 2021Quantum field-theoretic machine learningcited by 16
- 2020Baryons from Mesons: A Machine Learning Perspectivecited by 2
- 2021Machine learning with quantum field theoriescited by 2
- 2021Quantum field theories, Markov random fields and machine learningcited by 2
Built on by
Citing papers per year: 2022: 2; 2023: 2; 2024: 3; 2025: 1; 2026: 1.
9 papers.
- 2024FAdam: Adam is a natural gradient optimizer using diagonal empirical Fisher informationcited by 17
- 2023Bayesian Renormalizationcited by 13
- 2022The Inverse of Exact Renormalization Group Flows as Statistical Inferencecited by 11
- 2024Bayesian RG Flow in Neural Network Field Theoriescited by 9
- 2023Hierarchical Neural Simulation-Based Inference Over Event Ensemblescited by 8
- 2024Wilsonian Renormalization of Neural Network Gaussian Processescited by 8
- 2025Grokking vs. Learning: Same Features, Different Encodingscited by 2
- 2022Conjugate Natural Selectioncited by 0
- 2026Optimal Pruning for Neural Architectures using Fisher Information Distancescited by 0
- 2026Optimal Pruning for Neural Architectures using Fisher Information Distances14 Sep 2026
- 2025Grokking vs. Learning: Same Features, Different Encodings3 Feb 2025
- 2024Bayesian RG Flow in Neural Network Field Theories27 May 2024
- 2024FAdam: Adam is a natural gradient optimizer using diagonal empirical Fisher information21 May 2024
- 2024Wilsonian Renormalization of Neural Network Gaussian Processes9 May 2024
- 2023Hierarchical Neural Simulation-Based Inference Over Event Ensembles21 Jun 2023
- 2023Bayesian Renormalization17 May 2023
- 2022The Inverse of Exact Renormalization Group Flows as Statistical Inference21 Dec 2022
- 2022Conjugate Natural Selection29 Aug 2022