Neural Galerkin Normalizing Flows for Bayesian Inference of Diffusions with Inaccessible Boundaries

• URL: http://arxiv.org/abs/2606.04324v1
• Date: Wed, 03 Jun 2026 00:52:26 GMT
• Title: Neural Galerkin Normalizing Flows for Bayesian Inference of Diffusions with Inaccessible Boundaries
• Abstract summary: We propose a new Normalizing Flow architecture to learn the transition density function of the diffusion process between two observation times.<n>We specifically focus on processes whose diffusion matrix vanishes in certain inaccessible regions.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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. 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. We do so by solving in a Neural Galerkin framework the associated FP equation with a Dirac mass as initial condition, over a specified training distribution of the initial datum and the coefficients of the diffusion. We specifically focus on processes whose diffusion matrix vanishes in certain inaccessible boundary regions, such as Stochastic Volatility models that satisfy a Feller condition. The product of the obtained transition densities evaluated along the observed trajectory approximates the likelihood function, thereby enabling cheap posterior sampling via Markov chain Monte Carlo (MCMC). After the offline training phase, inference becomes significantly more efficient, as it avoids the need to solve the FP equation in real time for each parameter proposed by the MCMC sampler or to rely on other likelihood-free methods for Bayesian inference that involve repeated simulation of diffusion bridges.

Related papers

• Stochastic Transition-Map Distillation for Fast Probabilistic Inference [14.377745343756485]
  Diffusion models achieve strong generation quality, diversity, and distribution coverage, but their performance often comes with expensive inference.<n>In this work, we propose Transition-Map Distillation (STMD), a teacher-free framework for accelerating diffusion model inference.
  arXiv  Detail & Related papers  (2026-05-08T12:31:44Z)
• A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models [0.3222802562733787]
  We survey continuous-time generative modeling methods based on transporting a simple reference distribution to a data distribution via deterministic dynamics.<n>We present a unified framework in which diffusion models, score-based generative models, and flow matching are instances of learning a time-dependent vector field.
  arXiv  Detail & Related papers  (2026-05-07T18:32:15Z)
• Neural Galerkin Normalizing Flow for Transition Probability Density Functions of Diffusion Models [0.0]
  We propose a new framework to approximate the transition probability density function of a diffusion process.<n>We look for the solution as a transformation of the transition probability density function of a reference process.<n>We derive a system of ODEs for the time evolution of the Normalizing Flow's parameters.
  arXiv  Detail & Related papers  (2026-03-19T13:43:18Z)
• An Elementary Approach to Scheduling in Generative Diffusion Models [55.171367482496755]
  An elementary approach to characterizing the impact of noise scheduling and time discretization in generative diffusion models is developed.<n> Experiments across different datasets and pretrained models demonstrate that the time discretization strategy selected by our approach consistently outperforms baseline and search-based strategies.
  arXiv  Detail & Related papers  (2026-01-20T05:06:26Z)
• Diffusion Models: A Mathematical Introduction [3.8673630752805437]
  We present a self-contained derivation of diffusion-based generative models.<n>We construct denoising diffusion probabilistic models from first principles.<n>Readers can both follow the theory and implement the corresponding algorithms in practice.
  arXiv  Detail & Related papers  (2025-11-13T16:20:52Z)
• A Mixture-Based Framework for Guiding Diffusion Models [19.83064246586143]
  Denoising diffusion models have driven significant progress in the field of Bayesian inverse problems.<n>Recent approaches use pre-trained diffusion models as priors to solve a wide range of such problems.<n>This work proposes a novel mixture approximation of these intermediate distributions.
  arXiv  Detail & Related papers  (2025-02-05T16:26:06Z)
• Conditional Lagrangian Wasserstein Flow for Time Series Imputation [3.583527519172841]
  Conditional Lagrangian Wasserstein Flow is a novel method for time series imputation.<n>We learn the velocity by minimizing the corresponding kinetic energy.<n>To enhance the model's performance, we estimate the gradient of a task-specific potential function.
  arXiv  Detail & Related papers  (2024-10-10T02:46:28Z)
• Convergence of Score-Based Discrete Diffusion Models: A Discrete-Time Analysis [56.442307356162864]
  We study the theoretical aspects of score-based discrete diffusion models under the Continuous Time Markov Chain (CTMC) framework.<n>We introduce a discrete-time sampling algorithm in the general state space $[S]d$ that utilizes score estimators at predefined time points.<n>Our convergence analysis employs a Girsanov-based method and establishes key properties of the discrete score function.
  arXiv  Detail & Related papers  (2024-10-03T09:07:13Z)
• Amortized Posterior Sampling with Diffusion Prior Distillation [55.03585818289934]
  Amortized Posterior Sampling is a novel variational inference approach for efficient posterior sampling in inverse problems.<n>Our method trains a conditional flow model to minimize the divergence between the variational distribution and the posterior distribution implicitly defined by the diffusion model.<n>Unlike existing methods, our approach is unsupervised, requires no paired training data, and is applicable to both Euclidean and non-Euclidean domains.
  arXiv  Detail & Related papers  (2024-07-25T09:53:12Z)
• Amortizing intractable inference in diffusion models for vision, language, and control [89.65631572949702]
  This paper studies amortized sampling of the posterior over data, $mathbfxsim prm post(mathbfx)propto p(mathbfx)r(mathbfx)$, in a model that consists of a diffusion generative model prior $p(mathbfx)$ and a black-box constraint or function $r(mathbfx)$.<n>We prove the correctness of a data-free learning objective, relative trajectory balance, for training a diffusion model that samples from
  arXiv  Detail & Related papers  (2024-05-31T16:18:46Z)
• Reconstructing Graph Diffusion History from a Single Snapshot [87.20550495678907]
  We propose a novel barycenter formulation for reconstructing Diffusion history from A single SnapsHot (DASH) We prove that estimation error of diffusion parameters is unavoidable due to NP-hardness of diffusion parameter estimation. We also develop an effective solver named DIffusion hiTting Times with Optimal proposal (DITTO)
  arXiv  Detail & Related papers  (2023-06-01T09:39:32Z)
• Score-based Continuous-time Discrete Diffusion Models [102.65769839899315]
  We extend diffusion models to discrete variables by introducing a Markov jump process where the reverse process denoises via a continuous-time Markov chain. We show that an unbiased estimator can be obtained via simple matching the conditional marginal distributions. We demonstrate the effectiveness of the proposed method on a set of synthetic and real-world music and image benchmarks.
  arXiv  Detail & Related papers  (2022-11-30T05:33:29Z)
• Efficient CDF Approximations for Normalizing Flows [64.60846767084877]
  We build upon the diffeomorphic properties of normalizing flows to estimate the cumulative distribution function (CDF) over a closed region. Our experiments on popular flow architectures and UCI datasets show a marked improvement in sample efficiency as compared to traditional estimators.
  arXiv  Detail & Related papers  (2022-02-23T06:11:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.