Mirror Bridges Between Probability Measures

Leticia Mattos Da Silva, Silvia Sellán, Francisco Vargas, Justin Solomon

TL;DR

The paper introduces Mirror Bridges, a novel framework that solves the Schrödinger bridge problem to map a probability distribution to itself. This approach enables efficient conditional resampling—generating realistic, in-distribution variations of an existing data point—while using a single neural network to cut training costs in half compared to standard Schrödinger bridge methods.

What Problem Does This Paper Address?

Most generative models in machine learning (like standard diffusion models) excel at mapping a simple, known prior distribution (such as a Gaussian) to a complex data distribution (like natural images). However, a distinct and highly practical challenge is conditional resampling or proximal sampling: given a specific data point, how do you generate a new, slightly different sample that remains strictly within the same data distribution?

While you could theoretically use the identity map or an independent coupling, these extremes either give you the exact same data point or a completely unrelated one. Existing methods that attempt to interpolate between a distribution and itself often lack relative-entropy optimality, leading to slower sampling and less control. The authors tackle this gap by framing self-mapping as a specialized, time-symmetric version of the Schrödinger bridge problem (SBP).

Methods

The core innovation is the Mirror Schrödinger Bridge, which specializes the dynamic SBP to the case where the initial and final distributions are identical ($\pi_0 = \pi_1 = \pi$).

Key methodological highlights include:

  • Time Symmetry & Single Network: In a standard SBP, algorithms must learn two separate drift functions (forward and backward) using two distinct neural networks. The authors prove that because the mirror bridge is perfectly symmetric in time, the forward and backward drifts are identical ($f_t = b_t$). This allows them to train just one neural network, dramatically simplifying the architecture.
  • Symmetrized IPFP (Drift-Averaging): Instead of using the standard Iterative Proportional Fitting Procedure (IPFP), they introduce a first-order approximation called a drift-averaging operator: $$\mathcal{A}(v) := \frac{1}{2}(v + \mathcal{J}_\pi[v])$$ This operator explicitly suppresses time-asymmetric errors during training, forcing the model to respect the true symmetry of the mirror bridge.

  • Controllable Variation via Noise ($\sigma$): The framework utilizes a stationary Ornstein–Uhlenbeck (OU) process as its reference path measure. The noise coefficient ($\sigma$) of this process serves as a precise mathematical dial: a low $\sigma$ keeps generated samples highly proximal to the input, while a higher $\sigma$ increases sample variance and drives stronger mean reversion.

Datasets

The authors evaluated their method across three distinct domains:

  1. Synthetic 2D Datasets: Toy distributions (such as an S-curve and concentric circles) used to visually verify color mixing and distribution preservation.
  2. MNIST: The classic benchmark of handwritten digits, used for quantitative runtime and sample quality comparisons.
  3. CelebA: A complex dataset of celebrity facial images, used to demonstrate high-dimensional image resampling and variation control.

Key Insights and Ideas

  • The Richness of Self-Coupling: Mapping a distribution to itself sounds trivial at first glance. However, regularizing this self-mapping with entropy uncovers a smooth, mathematically optimal space of paths that naturally generate realistic variations of data points.
  • Symmetry Halves the Work: Exploiting time symmetry isn't just a theoretical curiosity; it eliminates the need for a second neural network. This directly translates to a massive reduction in computational overhead.
  • Kinetic Energy and Sampling Speed: By minimizing relative entropy on the path space, the mirror bridge inherently minimizes kinetic energy. In generative modeling, paths with minimal kinetic energy are strongly correlated with faster, more stable sampling at test time.

Key Results

  • 2x Training Speedup: Because only one network is trained, the mirror bridge achieves empirical convergence on par with state-of-the-art alternatives like Diffusion Schrödinger Bridges (DSB) and Diffusion Schrödinger Bridge Matching (DSBM), but requires half the training iterations and significantly lower total runtime.
  • Enforced Symmetry: Standard DSB often fails to maintain perfect time symmetry in practice due to optimization variances. The Mirror Bridge enforces it by construction.
  • Precise Proximity Control: Experiments on 2D datasets and images visually confirm that adjusting $\sigma$ reliably controls diversity. For instance, in image resampling, lower $\sigma$ values produce outputs visually indistinguishable from the source, while higher $\sigma$ values introduce distinct feature variations (e.g., altering facial expressions or lighting in CelebA) without leaving the data manifold.
2D resampling with varying noise
CelebA resampling variation

Limitations and Future Work

  • Theoretical Gap: While the drift-averaging procedure is a highly effective first-order approximation, the exact mathematical distance between its fixed point and the true, non-linear mirror Schrödinger bridge requires deeper quantitative bounding.
  • Discrete Class Jumps: The authors note that it would be valuable to study explicit $\sigma$ thresholds where a sample transitions from one sub-class to another (e.g., turning a handwritten '3' into an '8').
  • Extension to Advanced Architectures: A natural next step is adapting this time-symmetrization technique to more advanced SBP variants, such as DSBM, to combine the mirror bridge's speed with their architectural accuracy advantages.

Summary updated

Abstract

Resampling from a target measure whose density is unknown is a fundamental problem in mathematical statistics and machine learning. A setting that dominates the machine learning literature consists of learning a map from an easy-to-sample prior, such as the Gaussian distribution, to a target measure. Under this model, samples from the prior are pushed forward to generate a new sample on the target measure, which is often difficult to sample from directly. A related problem of particular interest is that of generating a new sample proximate to or otherwise conditioned on a given input sample. In this paper, we propose a new model called the mirror bridge to solve this problem of conditional resampling. Our key observation is that solving the Schrödinger bridge problem between a distribution and itself provides a natural way to produce new samples, giving in-distribution variations of an input data point. We demonstrate how to efficiently estimate the solution of this largely overlooked version of the Schrödinger bridge problem. We show that our proposed method leads to significant algorithmic simplifications over existing alternatives, in addition to providing control over in-distribution variation. Empirically, we demonstrate how these benefits can be leveraged to produce proximal samples in a number of application domains.
BibTeX
@misc{silva2024mirror,
  author = {Leticia Mattos Da Silva and Silvia Sellán and Francisco Vargas and Justin Solomon},
  title = {{Mirror Bridges Between Probability Measures}},
  year = {2024},
  eprint = {2410.07003},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2410.07003},
}
Figure