mlsanityData to 14 Oct 2026

Onsager-Machlup Posterior Transport for Deep Gaussian Processes

arXiv 2605.23434 ↗First posted 22 May 2026cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Approximate inference over inducing variables is the central computational bottleneck of Deep Gaussian Processes (DGPs). Existing methods either fit an explicit density qφ(bU) by an ELBO (DSVI, IPVI, DDVI, DBVI) or sample by MCMC (SGHMC). We instead frame DGP inference as posterior transport: learn a deterministic sampler that maps a tractable reference measure to posterior-relevant inducing variables, regularised by a path prior derived from the Doob-bridged reference diffusion. Our realisation, OM-Path (formally FBVI-bridge-Path), uses Song's probability-flow ODE applied to DBVI's Doob-bridged forward SDE; the reference drift is closed-form from the bridge marginal coefficients (no score matching) and the path regulariser is the Onsager--Machlup action. At the finite-ε value used at training, the objective is the negative log unnormalised density of a tempered Doob-bridge path posterior, and Theorem 1 identifies it with the same posterior's small-noise MAP path via the Freidlin--Wentzell LDP. Two strict path-space ELBO variants on the same bridge backbone (FFJORD log-det; OM-regularised CNF) are derived as ablations. Under a matched-seed paired Wilcoxon test against DBVI on seven UCI regression benchmarks, OM-Path delivers statistically significant wins on the two largest datasets (textitpower: p!=!0.014, NLL 0.012 matching the DSVI baseline of 0.017; textitprotein: p!=!0.002, RMSE 0.716 vs. 0.764, NLL 1.086 vs. 1.149), statistical ties on textityacht / textitqsar, and concedes textitboston / textitenergy / textitconcrete to DBVI on small-N noisy data. The strict-ELBO variants do not clear DBVI on any UCI metric: in this regime, reducing the variance of the path objective dominates exact-density tracking.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 20 of its 27 references that are in the map. First posted on arXiv 22 May 2026.

Builds on

20 of 27 references.

References · 20

  1. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
  2. 2022Flow Matching for Generative Modelingcited by 5,702
  3. 2018Neural Ordinary Differential Equationscited by 3,779
  4. 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flowcited by 3,700
  5. 2022Building Normalizing Flows with Stochastic Interpolantscited by 995
  6. 2024One Step Diffusion via Shortcut Modelscited by 391
  7. 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 292
  8. 2021Path Integral Sampler: a stochastic control approach for samplingcited by 181
  9. 2023Denoising Diffusion Samplerscited by 149
  10. 2017Doubly Stochastic Variational Inference for Deep Gaussian Processescited by 143
  11. 2023Diffusion Generative Flow Samplers: Improving learning signals through partial trajectory optimizationcited by 57
  12. 2018Inference in Deep Gaussian Processes using Stochastic Gradient Hamiltonian Monte Carlocited by 32
8 more
  1. 2025Action-Minimization Meets Generative Modeling: Efficient Transition Path Sampling with the Onsager-Machlup Functionalcited by 20
  2. 2019Implicit Posterior Variational Inference for Deep Gaussian Processescited by 17
  3. 2024Sparse Inducing Points in Deep Gaussian Processes: Enhancing Modeling with Denoising Diffusion Variational Inferencecited by 16
  4. 2025On scalable and efficient training of diffusion samplerscited by 10
  5. 2025Neural Flow Samplers with Shortcut Modelscited by 5
  6. 2025Diffusion Bridge Variational Inference for Deep Gaussian Processescited by 4
  7. 2022Are minimizers of the Onsager-Machlup functional strong posterior modes?cited by 2
  8. 2024Sequential Flow Straightening for Generative Modelingcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.