UniDB++: Fast Sampling of Unified Diffusion Bridge

• URL: http://arxiv.org/abs/2505.21528v1
• Date: Fri, 23 May 2025 15:03:02 GMT
• Title: UniDB++: Fast Sampling of Unified Diffusion Bridge
• Authors: Mokai Pan, Kaizhen Zhu, Yuexin Ma, Yanwei Fu, Jingyi Yu, Jingya Wang, Ye Shi,
• Abstract summary: Diffusion Bridges enable transitions between arbitrary distributions.<n>UniDB's reliance on iterative Euler sampling methods results in slow, computationally expensive inference.<n>We present UniDB++, a training-free sampling algorithm that significantly improves upon these limitations.
• Score: 73.73585888013665
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Diffusion Bridges enable transitions between arbitrary distributions, with the Unified Diffusion Bridge (UniDB) framework achieving high-fidelity image generation via a Stochastic Optimal Control (SOC) formulation. However, UniDB's reliance on iterative Euler sampling methods results in slow, computationally expensive inference, while existing acceleration techniques for diffusion or diffusion bridge models fail to address its unique challenges: missing terminal mean constraints and SOC-specific penalty coefficients in its SDEs. We present UniDB++, a training-free sampling algorithm that significantly improves upon these limitations. The method's key advancement comes from deriving exact closed-form solutions for UniDB's reverse-time SDEs, effectively reducing the error accumulation inherent in Euler approximations and enabling high-quality generation with up to 20$\times$ fewer sampling steps. This method is further complemented by replacing conventional noise prediction with a more stable data prediction model, along with an SDE-Corrector mechanism that maintains perceptual quality for low-step regimes (5-10 steps). Additionally, we demonstrate that UniDB++ aligns with existing diffusion bridge acceleration methods by evaluating their update rules, and UniDB++ can recover DBIMs as special cases under some theoretical conditions. Experiments demonstrate UniDB++'s state-of-the-art performance in image restoration tasks, outperforming Euler-based methods in fidelity and speed while reducing inference time significantly. This work bridges the gap between theoretical generality and practical efficiency in SOC-driven diffusion bridge models. Our code is available at https://github.com/2769433owo/UniDB-plusplus.

Related papers

• Acoustic Waveform Inversion with Image-to-Image Schrödinger Bridges [0.0]
  We introduce a conditional Image-to-Image Schr"odinger Bridge (c$textI2textSB$) framework to generate high-resolution samples.<n>Our experiments demonstrate that the proposed solution outperforms our reimplementation of conditional diffusion model.
  arXiv  Detail & Related papers  (2025-06-18T10:55:26Z)
• UniDB: A Unified Diffusion Bridge Framework via Stochastic Optimal Control [73.73585888013665]
  We propose UniDB, a unified framework for diffusion bridges based on Optimal Control (SOC)<n>UniDB formulates the problem through an SOC-based optimization and derives a closed-form solution for the optimal controller.<n>We demonstrate that existing diffusion bridges employing Doob's $h$-transform constitute a special case of our framework.
  arXiv  Detail & Related papers  (2025-02-09T02:43:57Z)
• Latent Schrodinger Bridge: Prompting Latent Diffusion for Fast Unpaired Image-to-Image Translation [58.19676004192321]
  Diffusion models (DMs), which enable both image generation from noise and inversion from data, have inspired powerful unpaired image-to-image (I2I) translation algorithms. We tackle this problem with Schrodinger Bridges (SBs), which are differential equations (SDEs) between distributions with minimal transport cost. Inspired by this observation, we propose Latent Schrodinger Bridges (LSBs) that approximate the SB ODE via pre-trained Stable Diffusion. We demonstrate that our algorithm successfully conduct competitive I2I translation in unsupervised setting with only a fraction of cost required by previous DM-
  arXiv  Detail & Related papers  (2024-11-22T11:24:14Z)
• Diffusion Bridge Implicit Models [25.213664260896103]
  Denoising diffusion bridge models (DDBMs) are a powerful variant of diffusion models for interpolating between two arbitrary paired distributions.<n>We take the first step in fast sampling of DDBMs without extra training, motivated by the well-established recipes in diffusion models.<n>We induce a novel, simple, and insightful form of ordinary differential equation (ODE) which inspires high-order numerical solvers.
  arXiv  Detail & Related papers  (2024-05-24T19:08:30Z)
• Adversarial Schrödinger Bridge Matching [66.39774923893103]
  Iterative Markovian Fitting (IMF) procedure alternates between Markovian and reciprocal projections of continuous-time processes. We propose a novel Discrete-time IMF (D-IMF) procedure in which learning of processes is replaced by learning just a few transition probabilities in discrete time. We show that our D-IMF procedure can provide the same quality of unpaired domain translation as the IMF, using only several generation steps instead of hundreds.
  arXiv  Detail & Related papers  (2024-05-23T11:29:33Z)
• Fast Ensembling with Diffusion Schrödinger Bridge [17.334437293164566]
  Deep Ensemble (DE) approach is a straightforward technique used to enhance the performance of deep neural networks by training them from different initial points, converging towards various local optima. We propose a novel approach called Diffusion Bridge Network (DBN) to address this challenge. By substituting the heavy ensembles with this lightweight neural network DBN, we achieved inference with reduced computational cost while maintaining accuracy and uncertainty scores on benchmark datasets such as CIFAR-10, CIFAR-100, and TinyImageNet.
  arXiv  Detail & Related papers  (2024-04-24T11:35:02Z)
• Direct Diffusion Bridge using Data Consistency for Inverse Problems [65.04689839117692]
  Diffusion model-based inverse problem solvers have shown impressive performance, but are limited in speed. Several recent works have tried to alleviate this problem by building a diffusion process, directly bridging the clean and the corrupted. We propose a modified inference procedure that imposes data consistency without the need for fine-tuning.
  arXiv  Detail & Related papers  (2023-05-31T12:51:10Z)
• Reflected Diffusion Models [93.26107023470979]
  We present Reflected Diffusion Models, which reverse a reflected differential equation evolving on the support of the data. Our approach learns the score function through a generalized score matching loss and extends key components of standard diffusion models.
  arXiv  Detail & Related papers  (2023-04-10T17:54:38Z)

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.