A new method for parameter estimation in probabilistic models: Minimum probability flow
Not on the map. Why?
Abstract (arXiv)
Fitting probabilistic models to data is often difficult, due to the general intractability of the partition function. We propose a new parameter fitting method, Minimum Probability Flow (MPF), which is applicable to any parametric model. We demonstrate parameter estimation using MPF in two cases: a continuous state space model, and an Ising spin glass. In the latter case it outperforms current techniques by at least an order of magnitude in convergence time with lower error in the recovered coupling parameters.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Jul 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 0; 2025: 3.
5 papers.
- 2021How Faithful is your Synthetic Data? Sample-level Metrics for Evaluating and Auditing Generative Modelscited by 193
- 2022From Denoising Diffusions to Denoising Markov Modelscited by 58
- 2025Self-Supervised Discovery of Neural Circuits in Spatially Patterned Neural Responses with Graph Neural Networkscited by 0
- 2025Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networkscited by 0
- 2025Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbitscited by 0
- 2025Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits16 Dec 2025
- 2025Redundancy Maximization as a Principle of Associative Memory Learning in Hopfield Networks4 Nov 2025
- 2025Self-Supervised Discovery of Neural Circuits in Spatially Patterned Neural Responses with Graph Neural Networks21 Sep 2025
- 2022From Denoising Diffusions to Denoising Markov Models7 Nov 2022
- 2021How Faithful is your Synthetic Data? Sample-level Metrics for Evaluating and Auditing Generative Models17 Feb 2021