Combines SMC and diffusion-based samplers for improved sampling performance.
problem Sampling from unnormalized densities efficiently and robustly.
method Viewing SMC and diffusion-based samplers as continuous-time processes, SCLD combines their strengths.
result SCLD achieves improved performance on multiple benchmark problems with less training budget.
AdaPID optimizes diffusion-based samplers by dynamically adjusting schedules.
problem Optimizing the intermediate-time dynamics in diffusion-based samplers.
method Develops a time-varying stiffness schedule using Piece-Wise-Constant (PWC) parametrizations and a hierarchical refinement approach.
result QoS-driven PWC schedules consistently improve sampling fidelity and accuracy.
A new algorithm improves posterior sampling for linear inverse problems.
problem Efficiently sampling from posterior distributions in noisy linear inverse problems.
method Proposes \pddim, a DDIM-type sampler that separately samples along singular directions of the measurement operator.
result The method converges to the Bayesian posterior conditioned on the measurements.
New analysis improves convergence guarantees for diffusion-based samplers in Wasserstein distance.
problem Improving convergence guarantees for diffusion-based generative models.
method Simple framework to analyze discretization, initialization, and score estimation errors.
result First Wasserstein convergence bound for the Heun sampler and improved results for Euler sampler.
Enhances diffusion-based sampling for molecular systems.
problem Inefficiency and thermodynamic mode miss in diffusion-based samplers for molecular systems.
method Introduces a sequential bias along collective variables (CVs) to encourage exploration and increase temperature in the projected space.
result Improves efficiency, mode discovery, and free energy estimation; first to demonstrate reactive sampling.
iDEM generates samples from Boltzmann densities without data.
problem Generating statistically independent samples from unnormalized distributions.
method Iterative algorithm using energy and gradient for diffusion-based sampler training.
result iDEM achieves state-of-the-art performance and trains faster than existing methods.
BNEM improves Boltzmann sampler efficiency.
problem Generating IID samples from Boltzmann distributions efficiently.
method Bootstrapped Noised Energy Matching (NEM) combined with diffusion-based learning and bootstrapping.
result BNEM achieves state-of-the-art performance with improved robustness.
PTSD improves neural samplers by combining diffusion models and PT, enhancing efficiency.
problem Efficiency and correlation issues in neural samplers compared to PT.
method Sequential training of diffusion models across temperatures, combining high-temperature models for approximate lower-temperature samples.
result Significantly improved target evaluation efficiency, outperforming diffusion-based samplers.
Optimal control theory connects diffusion models to generative modeling.
problem Sampling from unnormalized densities in statistics and computational sciences.
method Deriving a Hamilton-Jacobi-Bellman equation and applying control theory to minimize Kullback-Leibler divergence.
result Time-reversed diffusion sampler (DIS) outperforms other diffusion-based sampling methods.
Develops diffusion samplers for target distributions with efficient score and density estimates.
problem Estimating scores and densities for time-varying distributions.
method Sequential Monte Carlo with diffusion paths and control variates.
result Effective samplers for time-varying distributions with theoretical guarantees and practical applications.
Paper adapts diffusion sampler training for faster convergence and better sampling.
problem Training limitations in diffusion samplers.
method Decouples generation and destruction variances, learns both as unconstrained Gaussians.
result Training both processes leads to faster convergence and improved sampling quality.
Paper proposes a new method to speed up diffusion models.
problem High computational cost of sampling from diffusion models.
method Stochastic Runge-Kutta method for acceleration.
result Provable acceleration with reduced score function evaluations.
ASBS improves sampling from Boltzmann distributions without importance weighting.
problem Sampling from Boltzmann distributions with known energies but unknown samples.
method Adjoint Schrödinger Bridge Sampler using kinetic-optimal transportation.
result ASBS achieves scalable and efficient sampling without importance weighting.
The paper improves the probability flow ODE sampler for faster sampling of natural images.
problem Improving the convergence rate of the probability flow ODE sampler.
method Adapting the probability flow ODE sampler to exploit intrinsic low-dimensional structures in natural image data.
result Achieves a dimension-free convergence rate of O(k/T) in total variation distance, improving upon existing results. PDNS tackles multimodal sampling challenges using proximal point method.
problem Multimodal distributions with significant barriers between modes.
method Proximal point method on path measures, decomposing into simpler subproblems.
result PDNS effectively promotes thorough exploration across modes.
A new method de-randomizes MCMC dynamics using the Stein operator.
problem Estimating complex target distributions in Bayesian inference.
method De-randomized kernel-based particle samplers that discretize the fiber-gradient Hamiltonian flow.
result GSVGD de-randomizes complex MCMC dynamics, maintaining high sample quality.
New theory improves diffusion model convergence for generating data.
problem Improving convergence of diffusion models for data generation.
method Developed a non-asymptotic convergence theory for probability flow ODEs.
result Proves d/ε iterations suffice for approximating target distributions. DPS uses PINNs to estimate drift in diffusion models for sampling.
problem Accurately estimating drift term in reverse SDE from unnormalized density.
method Diffusion-PINN Sampler (DPS) solves PINN for log-density of SDE marginals.
result DPS achieves convergence guarantees and accurately samples complex distributions.
New theory improves diffusion models' convergence rates.
problem Understanding and optimizing diffusion models for faster data generation.
method Developed non-asymptotic theory for diffusion models with minimal assumptions.
result Established convergence rates for two diffusion models.
This paper tackles sampling issues in latent space EBMs by introducing diffusion-based amortization.
problem Degenerate MCMC sampling quality hinders latent space EBM learning and generation quality.
method Introduces diffusion-based amortization for long-run MCMC sampling.
result The learned amortization of MCMC is a valid long-run MCMC sampler.
A new method samples from multi-modal distributions without hyperparameter tuning.
problem Sampling from multi-modal distributions is challenging and requires tuning hyperparameters.
method Learned Reference-based Diffusion Sampler (LRDS) that learns a reference model on high-density regions and uses it to train a diffusion-based sampler.
result LRDS best exploits prior knowledge on multi-modal distributions compared to competing algorithms.
Generative sampler learns velocity fields for efficient posterior inference.
problem Sampling from complex posterior distributions in high dimensions.
method Generative multivariate posterior sampler via flow matching, learning a velocity field for a deterministic transport map.
result Conditional Brenier map enables fast generation of credible sets with theoretical consistency guarantees.
New method uses zeroth-order queries to approximate proximal sampling efficiently.
problem Approximating proximal sampling with zeroth-order information.
method Direct simulation of heat flow dynamics, treating intermediate distribution as Gaussian mixture.
result Inherits exponential convergence under isoperimetric conditions, avoids rejection sampling.
Improves inference-time alignment for diffusion models without updating weights.
problem Aligning diffusion models without updating weights for high-reward outputs.
method Trust-Region Iterative Twisted Sequential Monte Carlo (TRI-TSMC) for variance reduction and efficiency.
result Improves primary alignment objectives on text generation tasks.
Adaptive teacher improves sample efficiency and mode coverage in sampling tasks.
problem Efficient exploration and mode coverage in sampling tasks with amortized inference.
method An adaptive training distribution (teacher) guides the training of the primary sampler (student).
result Improves sample efficiency and mode coverage across various tasks.
FM4PDE learns PDE solutions from sparse data.
problem Reconstructing PDE solutions from limited observations.
method Flow-matching generative framework that learns PDE coefficients and solutions.
result Error guarantees for guided procedures, including deterministic and stochastic samplers.
New sampling method for heavy-tailed distributions using Langevin Algorithm.
problem Sampling from heavy-tailed distributions efficiently.
method Transformed Unadjusted Langevin Algorithm on specific transformations.
result Polynomial-order oracle complexities for certain heavy-tailed densities.
Paper tackles sampling from non-log-concave distributions using denoising diffusion.
problem Sampling from non-log-concave distributions efficiently.
method DDMC framework, Zeroth-Order Diffusion Monte Carlo (ZOD-MC) algorithm.
result ZOD-MC achieves inverse polynomial dependence on sampling accuracy, efficient for low dimensions.
ERDM integrates rolling forecasts with diffusion models for complex dynamics.
problem Forecasting complex dynamics with rolling forecasts and diffusion models.
method Adapting EDM components for rolling forecasts, introducing novel loss weighting, efficient initialization, and hybrid architecture.
result ERDM outperforms diffusion-based baselines in 2D Navier-Stokes simulations and ERA5 weather forecasting.
Improved hypothesis testing and change-point detection using diffusion-based methods.
problem Limited power of score-based hypothesis tests and change-point detection.
method Extending score-based Fisher divergence to diffusion-divergence by multiplying score functions with a matrix-valued function or weight matrix.
result Theoretical quantification and demonstration of optimal performance of diffusion-based algorithms.
We make posterior sampling in FWI feasible for large surveys.
problem Uncertainty-aware subsurface models at field scale.
method Coupling diffusion-based posterior sampling with simultaneous-source FWI data.
result Lower model error and better data fit at reduced computational cost.
Flow Annealing Posterior Sampling unifies stochastic-process regression and PDE inverse problems.
problem Function-space posterior sampling for stochastic processes and inverse problems.
method Flow Annealing Posterior Sampling (FAPS) using pretrained function-space flow-matching priors.
result Coherent posterior samples with accurate uncertainty quantification.
FastVoiceGrad speeds up VC to one step, matching or surpassing quality.
problem Slow inference in multi-step diffusion-based VC.
method Adversarial Conditional Diffusion Distillation (ACDD) for one-step diffusion.
result One-shot VC with superior or comparable performance to multi-step methods.
Improved sampling in generative models using CLDs with a hyperparameter.
problem Improving sampling performance in generative models.
method Extending Critically-damped Langevin Diffusions with a hyperparameter to control noise.
result Derivation of a novel upper bound on Wasserstein sampling error.
A new algorithm reduces sampling complexity for general distributions.
problem Sampling from complex target distributions efficiently.
method Recursive score estimation method for diffusion-based Monte Carlo.
result Gradient complexity improved from exponential to quasi-polynomial.
Improved deep hierarchical VAE with diffusion-based VampPrior.
problem Latent variable generative modeling challenges.
method Hierarchical VAE with amortized diffusion-based VampPrior.
result Better performance with fewer parameters and improved stability.
Theoretical justification for image inpainting using diffusion models.
problem Improving sample recovery in image inpainting without retraining.
method Analysis of RePaint algorithm and proposing RePaint+ to correct misalignment. result RePaint+ algorithm provably recovers the true sample with linear convergence. This work introduces a method for visualizing high-dimensional posteriors using hierarchical tree-valued predictions.
problem Visualizing high-dimensional posterior distributions for complex problems like image restoration.
method A neural network predicts a tree-valued hierarchical summarization of the posterior distribution in a single forward pass.
result The method efficiently summarizes and visualizes posteriors, achieving comparable results to hierarchical clustering but at a much faster speed.
New method uses diffusion models to optimize experimental design efficiently.
problem Optimizing experimental design for high-dimensional and complex settings.
method Introduces a pooled posterior distribution and uses diffusion-based samplers for efficient sampling and optimization.
result Extends Bayesian Optimal Experimental Design to practical scenarios.
There is a need for affordable, widely deployable maternal-fetal ECG monitors to improve maternal and fetal health during pregnancy and delivery. Based on the diffusion-based channel selection, here we present the mathematical formalism and clinical validation of an algorithm capable of accurate separation of maternal …
Turbo-DDCM speeds up zero-shot image compression.
problem Slowness and high computational demand in zero-shot diffusion-based compression.
method Modified DDCM framework with Turbo-DDCM, combining noise vectors and improved encoding.
result Turbo-DDCM achieves faster compression than state-of-the-art methods.
Corrected samplers reduce discretization error in discrete flow models without additional computational cost.
problem Discretization error in samplers for discrete flow models.
method Established non-asymptotic error bounds for samplers, proposed time-corrected and location-corrected samplers.
result Location-corrected sampler has lower complexity and better generation quality.
New samplers improve MCMC efficiency in high dimensions.
problem Efficient sampling in high-dimensional problems.
method Affine invariant ensemble samplers, including derivative-free and derivative-based HMC.
result Affine invariant ensemble HMC outperforms standard HMC in high dimensions.
DDSME outperforms SME in estimating multimodal distributions.
problem Efficiency of score matching in multimodal distributions.
method Diffusion-based denoising score matching (DDSME) compared to vanilla score matching (SME).
result DDSME avoids the error bound deterioration of SME with increasing mode separation.
New study shows Gaussian samplers struggle with heavy-tailed targets, while stable samplers excel.
problem The difficulty of sampling from heavy-tailed distributions using Gaussian versus stable oracles.
method Comparison of Gaussian and stable oracles for proximal samplers.
result Gaussian samplers have a fundamental barrier for high-accuracy guarantees in heavy-tailed sampling, while stable samplers excel.
GDiff tackles blind denoising with Gibbs sampling and Monte Carlo inference.
problem Blind denoising of signals with unknown noise parameters.
method Gibbs Diffusion (GDiff) method that alternates sampling steps from a conditional diffusion model and a Monte Carlo sampler.
result GDiff achieves blind denoising of natural images and cosmic microwave background data.
SRO optimizes decisions against worst-case sampler induced by generative models.
problem Operational uncertainty shifts from explicit probability law to sampler induced by learned generators.
method SRO optimizes decisions against the worst-case sampler induced by perturbing the learned generator.
result Empirical worst-case objective provides high-probability upper certificate for true population objective.
The Gibbs sampler is a particularly popular Markov chain used for learning and inference problems in Graphical Models (GMs). These tasks are computationally intractable in general, and the Gibbs sampler often suffers from slow mixing. In this paper, we study the Swendsen-Wang dynamics which is a more sophisticated Mark…