arXiv:2603. 27996v2 Announce Type: replace Abstract: Diffusion models have emerged as a powerful framework for generative tasks in deep learning.
arXiv:2609.27306v1 Announce Type: new Abstract: Conventional score-based diffusion models learn scores without representing normalized densities, whereas tractable normalized models support both samp...
arXiv:2601. 21026v2 Announce Type: replace-cross Abstract: Sampling configurations at thermodynamic equilibrium is a central challenge in statistical physics.
arXiv:2606. 30773v1 Announce Type: cross Abstract: We introduce a novel technique for scalable sampling of spin-system states with continuous symmetries using diffusion models.
arXiv:2502. 07580v4 Announce Type: replace Abstract: We present a novel view of diffusion-like generative modeling from the perspective of iterative Gaussian posterior inference.
The paper introduces a new Markov chain Monte Carlo method that samples from multimodal distributions by interpolating along the diffusion path of a noising diffusion process, preserving mode weights and improving mixing. It proposes a Metropolis-adjusted diffusion path (MAD-Path) sampler that corrects for bias from approximate score estimates and discretization errors, ensuring the target distribution remains invariant. Experiments on Bayesian posteriors demonstrate that MAD-Path outperforms tempering-based MCMC and unadjusted diffusion samplers in global exploration and accurate mode-weight estimation.
arXiv:2606. 04324v1 Announce Type: new Abstract: One of the primary challenges in Bayesian inference on the parameters of a diffusion model from discrete observations is the unavailability of an analytical expression for the transition density function between consecutive observation times, which is needed to derive the likelihood function.
One of the primary challenges in Bayesian inference on the parameters of a diffusion model from discrete observations is the unavailability of an analytical expression for the transition density function between consecutive observation times, which is needed to derive the likelihood function. Extending previous studies that solve Fokker-Planck (FP) type partial differential equations with Normalizing Flows, we propose a new Normalizing Flow architecture to learn the transition density function of the diffusion process between two observation times.
arXiv:2608. 07648v1 Announce Type: cross Abstract: Sampling high-dimensional probability distributions is a central task in scientific computing, with applications ranging from Bayesian inference to statistical physics and molecular simulation.
arXiv:2608. 01833v1 Announce Type: cross Abstract: Grokking is a striking phenomenon in neural network training, where a model can undergo a prolonged period of pure memorization before abrupt generalization.
The paper introduces Particle GFlowNets, showing that Generative Marginalization Models (MaMs) are equivalent to Generative Flow Networks. It extends MaMs to non‑autoregressive sampling and proposes an automatic full‑state rejuvenation criterion based on the Gelman‑Rubin statistic to accelerate learning. Experiments demonstrate significant training speedups in large combinatorial spaces.
arXiv:2609.00955v1 Announce Type: new Abstract: Diffusion models achieve strong image generation quality but incur high iterative denoising costs. Analog compute-in-memory (CIM) can accelerate matrix...
arXiv:2609.00279v1 Announce Type: cross Abstract: This work shows that diffusion models learned with standard denoising loss can provide effective global MCMC proposals for complex high-dimensional t...