mlsanityData to 7 Oct 2026

Score matching for bridges without learning time-reversals

arXiv 2407.15455 ↗First posted 22 Jul 2024stat.ML cs.LG math.PRcited by 5

Not on the map. Why?

Abstract (arXiv)

We propose a new algorithm for learning bridged diffusion processes using score-matching methods. Our method relies on reversing the dynamics of the forward process and using this to learn a score function, which, via Doob's h-transform, yields a bridged diffusion process; that is, a process conditioned on an endpoint. In contrast to prior methods, we learn the score term nablax log p(t, x; T, y) directly, for given t, y, completely avoiding first learning a time-reversal. We compare the performance of our algorithm with existing methods and see that it outperforms using the (learned) time-reversals to learn the score term. The code can be found at https://github.com/libbylbaker/forwardbridge.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 9 of its 43 references that are in the map. First posted on arXiv 22 Jul 2024.

Builds on

9 of 43 references.

References · 9

  1. 2017Attention Is All You Needcited by 59,932
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 594
  4. 2023Denoising Diffusion Bridge Modelscited by 171
  5. 2021Simulating Diffusion Bridges with Score Matchingcited by 51
  6. 2024Infinite-dimensional Diffusion Bridge Simulation via Operator Learningcited by 7
  7. 2024What's the score? Automated Denoising Score Matching for Nonlinear Diffusionscited by 7
  8. 2020Automatic Backward Filtering Forward Guiding for Markov processes and graphical modelscited by 5
  9. 2016A Stochastic Large Deformation Model for Computational Anatomycited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 4.

5 papers.