arXiv:2604. 08580v2 Announce Type: replace-cross Abstract: Reward fine-tuning of diffusion and flow models and sampling from tilted or Boltzmann distributions can both be formulated as stochastic optimal control (SOC) problems, where learning an optimal generative dynamics corresponds to optimizing a control under SDE constraints.
By Carles Domingo-Enrich, Jiequn Han
arXiv:2608. 13800v1 Announce Type: new Abstract: Transition path sampling (TPS) aims to efficiently generate rare molecular transition trajectories between metastable states and is essential for understanding biomolecular mechanisms.
By Jingqian Liu, Yu-Hsiang Wang, Yanru Qu, Ge Liu
arXiv:2509.26364v3 Announce Type: replace
Abstract: The Schr\"odinger bridge problem is concerned with finding a stochastic dynamical system bridging two marginal distributions that minimises a certa...
By Kirill Tamogashev, Esmeralda S. Whitammer
arXiv:2605. 30920v2 Announce Type: replace Abstract: Diffusion-based neural solvers have shown strong promise for combinatorial optimization (CO), but existing methods typically rely on supervised training with large collections of near-optimal solutions.
By Shengyu Feng, Tarun Suresh, Yiming Yang
arXiv:2607. 06644v1 Announce Type: cross Abstract: Determinantal point processes have recently emerged as a kernel-based alternative to standard independent sampling for constructing efficient minibatches, coresets, and other compact representations of large-scale datasets.
By Hoang-Son Tran, Pranav Gupta, Subhroshekhar Ghosh
arXiv:2606. 30064v1 Announce Type: new Abstract: We introduce a data-driven probabilistic framework for learning systems based on Gibbs measures on hierarchical structures.
By L. U. Abdullaev, F. Herrera, U. A. Rozikov, M. V. Velasco
arXiv:2605. 17232v2 Announce Type: replace Abstract: Discrete diffusion has become a leading framework for generative modeling in various applications including language, vision, and biology.
By Kelvin Kan, Xingjian Li, Benjamin J. Zhang, Tuhin Sahai, Stanley Osher, Markos A. Katsoulakis
arXiv:2609.15894v1 Announce Type: cross
Abstract: Some of the sharpest challenges in sampling from the energy functions of physical systems arise at phase transitions, where the density of states cha...
By David Yallup
The paper investigates training diffusion models to sample from distributions defined by unnormalized densities or energy functions. It benchmarks various diffusion-structured inference techniques, including simulation-based variational methods and off-policy approaches such as continuous generative flow networks, highlighting their relative strengths and challenging some prior claims. Additionally, the authors introduce a new exploration strategy for off-policy methods that employs local search in the target space with a replay buffer, demonstrating improved sample quality across multiple target distributions.
By Marcin Sendera, Minsu Kim, Sarthak Mittal, Pablo Lemos, Luca Scimeca, Jarrid Rector-Brooks, Alexandre Adam, Yoshua Bengio, Esmeralda S. Whitammer
We introduce a data-driven probabilistic framework for learning systems based on Gibbs measures on hierarchical structures. Unlike standard empirical risk minimization, where a dataset is used to identify a single optimal parameter, our approach transforms the empirical loss function into an interaction potential defining an energy-based model.
arXiv:2610.01522v1 Announce Type: cross
Abstract: Many scientific and machine learning systems, from molecular dynamics to diffusion models and beyond, are governed by stochastic dynamics with low-di...
By Vladimir R. Kostic, Karim Lounici, H\'el\`ene Halconruy, Timoth\'ee Devergne, Michele Parrinello, Massimiliano Pontil
The paper presents an amortized neural sampler that merges operator learning with flow-based methods to efficiently sample from invariant measures of stochastic differential equations (SDEs). By mapping SDE coefficient functions to pushforwards from a reference measure, the approach shifts the sampling cost to an initial training phase, after which new SDE instances can be sampled with a single encoder pass and a few ODE solver steps, independent of mixing time. The framework incorporates Lagrangian trajectory sensors and cross attention to handle high-dimensional problems, and the authors provide theoretical guarantees of expressivity and resolution invariance, demonstrating competitive accuracy and significant speedups over MCMC in 1D, 2D, and 64D SDE families.
By Lin Guo, Li Lei, Jingtong Zhang