aiqbench analysis
This research introduces a novel sample-free algorithm for learning Boltzmann distributions by shifting from sample-trajectory to distribution-trajectory matching, effectively addressing critical slowing down in Markov Chain Monte Carlo methods. The approach demonstrates superior sampling performance and accuracy on complex benchmarks like high-dimensional scalar field theories, offering a scalable alternative for modeling intricate physical systems without relying on costly training data.
FUND: Density Flow for Sampling Unnormalised Distributions
arXiv:2609.32296v1 Announce Type: new Abstract: Efficient sampling from Boltzmann distributions is central to modelling complex physical systems. Markov Chain Monte Carlo (MCMC) methods suffer from critical slowing down, high autocorrelation, and poor mode-mixing, limiting their scalability. Recent advances, like Boltzmann Generators, offer a promising alternative but remain constrained by costly MCMC-based training, inefficient sampling, and poor ergodicity. We introduce an algorithm for learning Boltzmann distributions that does not require any true samples for training. Our approach draws inspiration from flow matching but departs fundamentally from sample-trajectory matching to distribution-trajectory matching. The algorithm iteratively reshapes the target distribution, using model generated samples to guide learning and ensure comprehensive mode coverage. We validate our method on standard benchmarks, including a 2D Gaussian mixture, Many-Well distributions, and high-dimensional scalar $\phi^4$ theory. The proposed approach not only improves sampling performance and accuracy over traditional MCMC and flow-based baselines but also establishes a new method for sample-free learning of complex physical distributions.
Abstract:Efficient sampling from Boltzmann distributions is central to modelling complex physical systems. Markov Chain Monte Carlo (MCMC) methods suffer from critical slowing down, high autocorrelation, and poor mode-mixing, limiting their scalability. Recent advances, like Boltzmann Generators, offer a promising alternative but remain constrained by costly MCMC-based training, inefficient sampling, and poor ergodicity. We introduce an algorithm for learning Boltzmann distributions that does not require any true samples for training. Our approach draws inspiration from flow matching but departs fundamentally from sample-trajectory matching to distribution-trajectory matching. The algorithm iteratively reshapes the target distribution, using model generated samples to guide learning and ensure comprehensive mode coverage. We validate our method on standard benchmarks, including a 2D Gaussian mixture, Many-Well distributions, and high-dimensional scalar $\phi^4$ theory. The proposed approach not only improves sampling performance and accuracy over traditional MCMC and flow-based baselines but also establishes a new method for sample-free learning of complex physical distributions.
Machine Learning (cs.LG); High Energy Physics - Lattice (hep-lat)
arXiv:2609.32296 [cs.LG]
(or arXiv:2609.32296v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.32296 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 252 words
Related coverage
Data-to-Energy Stochastic Dynamics
arXiv · Sep 1, 2026

News
Quantum Computing Report · Jun 7, 2026

News
Quantum Computing Report · Jul 25, 2026
SIMANF: Sample Free Learning of Unnormalized Distributions via Simulated Annealing in Normalizing Flows
arXiv · Sep 30, 2026