QDSB: Quantized Diffusion Schrödinger Bridges

• URL: http://arxiv.org/abs/2605.11983v1
• Date: Tue, 12 May 2026 11:35:08 GMT
• Title: QDSB: Quantized Diffusion Schrödinger Bridges
• Abstract summary: We propose quantized diffusion Schrdinger bridges (QDSB), which compute the endpoint coupling on anchor-quantized endpoint distributions.<n>We show that the regularized optimal coupling is stable w.r.t. anchor quantization, with an error controlled by the quality of the anchor approximation.
• Score: 4.3331379059769395
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Learning generative models in settings where the source and target distributions are only specified through unpaired samples is gaining in importance. Here, one frequently-used model are Schrödinger bridges (SB), which represent the most likely evolution between both endpoint distributions. To accelerate training, simulation-free SBs avoid the path simulation of the original SB models. However, learning simulation-free SBs requires paired data; a coupling of the source and target samples is obtained as the solution of the entropic optimal transport (OT) problem. As obtaining the optimal global coupling is infeasible in many practical cases, the entropic OT problem is iteratively solved on minibatches instead. Still, the repeated cost remains substantial and the locality can distort the global transport geometry. We propose quantized diffusion Schrödinger bridges (QDSB), which compute the endpoint coupling on anchor-quantized endpoint distributions and lift the resulting plan back to original data points through cell-wise sampling. We show that the regularized optimal coupling is stable w.r.t. anchor quantization, with an error controlled by the quality of the anchor approximation. In real-world experiments, QDSB matches the sample quality of existing baselines, requiring substantially less time. Code and data are available at github.com/mathefuchs/qdsb.

Related papers

• One-Sided Quantile Coupling for Flow Matching [8.295726579539016]
  Flow Matching trains continuous-time generative models by regressing the velocity field of a probability path between a simple source distribution and a target data distribution.<n>We propose Quantile Coupling Flow Matching (QC-FM), a lightweight one-sided coupling that samples only the data batch and constructs each paired source directly.<n>QC-FM improves over the Baseline under matched training budgets, reducing FID by up to 12.9%, and outperforms OT-CFM on all four datasets.
  arXiv  Detail & Related papers  (2026-08-02T04:03:59Z)
• Optimal Transport Flow Matching by Design [26.301026025241374]
  Flow matching models learn to transport samples from a simple prior distribution to a complex data distribution.<n>We reformulate the problem by treating the prior as a design choice rather than a fixed input.<n>Our method reduces trajectory curvature by more than $2times$ compared to existing flow matching methods.
  arXiv  Detail & Related papers  (2026-06-02T18:00:05Z)
• Entropy Across the Bridge: Conditional-Marginal Discretization for Flow and Schrödinger Samplers [68.9946633641494]
  Flow matching and Schrdinger bridges define probability, yet their inference grids are usually or inherited from one-endpoint diffusion.<n>We derive a conditional-marginal entropy-rate objective for bridge-aware discretization, separating endpoint-conditioned bridge geometry from marginal flow evolution.<n>On EDM/CIFAR-10, the entropic time-discretization gives the best tested five-step FID (186.3 pm 4.0 versus 200.5 pm 2.9 for linear and 238.0 pm 5.3 for cosine)
  arXiv  Detail & Related papers  (2026-05-15T16:11:10Z)
• Multi-Fidelity Flow Matching: Cascaded Refinement of PDE Solutions [6.144605787421899]
  Multi-Fidelity Flow Matching is a cascade refinement framework for PDE solutions.<n>We exploit this in Multi-Fidelity Flow Matching (MFFM), a cascade refinement framework for PDE solutions.<n>MFFM is a learned analog of multigrid refinement that reaches the finest grid in $L$ deterministic network evaluations per query.
  arXiv  Detail & Related papers  (2026-05-15T16:02:18Z)
• Analytic Bridge Diffusions for Controlled Path Generation [0.0]
  Most modern bridge-diffusion methods achieve finite-time transport by specifying an objective and then learning the associated score or drift field with a neural network.<n>In LQ-GM-PID, we retain the linear-quadratic-control backbone, but replace terminal state regulation by a prescribed terminal probability density.<n>LQ-GM-PID turns bridge diffusion from a tool for terminal target matching alone into a tool for path shaping.
  arXiv  Detail & Related papers  (2026-05-03T05:36:52Z)
• Test-Time Scaling with Diffusion Language Models via Reward-Guided Stitching [66.39914384073145]
  We propose a self-consistency framework that turns cheap diffusion-sampled reasoning into a reusable pool of step-level candidates.<n>We find that step-level recombination is most beneficial on harder problems.<n>Our training-free framework improves average accuracy by up to 2 across six math and coding tasks.
  arXiv  Detail & Related papers  (2026-02-26T11:08:39Z)
• Learnable Chernoff Baselines for Inference-Time Alignment [64.81256817158851]
  We introduce Learnable Chernoff Baselines as a method for efficiently and approximately sampling from exponentially tilted kernels.<n>We establish total-variation guarantees to the ideal aligned model, and demonstrate in both continuous and discrete diffusion settings that LCB sampling closely matches ideal rejection sampling.
  arXiv  Detail & Related papers  (2026-02-08T00:09:40Z)
• Adjoint Schrödinger Bridge Sampler [27.07623265593163]
  Adjoint Schr"odinger Bridge Sampler (ASBS) is a new diffusion sampler that employs simple and scalable matching-based objectives.<n>ASBS is grounded on a mathematical model -- the Schr"odinger Bridge -- which enhances sampling efficiency via kinetic-optimal transportation.
  arXiv  Detail & Related papers  (2025-06-27T18:27:59Z)
• On the Wasserstein Convergence and Straightness of Rectified Flow [54.580605276017096]
  Rectified Flow (RF) is a generative model that aims to learn straight flow trajectories from noise to data.<n>We provide a theoretical analysis of the Wasserstein distance between the sampling distribution of RF and the target distribution.<n>We present general conditions guaranteeing uniqueness and straightness of 1-RF, which is in line with previous empirical findings.
  arXiv  Detail & Related papers  (2024-10-19T02:36:11Z)
• Localized Schrödinger Bridge Sampler [0.276240219662896]
  We build on previous work combining Schr"odinger bridges and plug & play Langevin samplers. A key bottleneck of these approaches is the exponential dependence of the required training samples. We propose a localization strategy which exploits conditional independence of conditional expectation values.
  arXiv  Detail & Related papers  (2024-09-12T12:02:51Z)
• Soft-constrained Schrodinger Bridge: a Stochastic Control Approach [4.922305511803267]
  Schr"odinger bridge can be viewed as a continuous-time control problem where the goal is to find an optimally controlled diffusion process. We propose to generalize this problem by allowing the terminal distribution to differ from the target but penalizing the Kullback-Leibler divergence between the two distributions. One application is the development of robust generative diffusion models.
  arXiv  Detail & Related papers  (2024-03-04T04:10:24Z)
• Simulation-free Schr\"odinger bridges via score and flow matching [89.4231207928885]
  We present simulation-free score and flow matching ([SF]$2$M) Our method generalizes both the score-matching loss used in the training of diffusion models and the recently proposed flow matching loss used in the training of continuous flows. Notably, [SF]$2$M is the first method to accurately model cell dynamics in high dimensions and can recover known gene regulatory networks simulated data.
  arXiv  Detail & Related papers  (2023-07-07T15:42:35Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• The Schr\"odinger Bridge between Gaussian Measures has a Closed Form [101.79851806388699]
  We focus on the dynamic formulation of OT, also known as the Schr"odinger bridge (SB) problem. In this paper, we provide closed-form expressions for SBs between Gaussian measures.
  arXiv  Detail & Related papers  (2022-02-11T15:59:01Z)

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.