Abstract notes on generative modeling techniques.
problem Improving generative modeling techniques.
method Connections between optimal transport and Schrödinger bridge, flow matching.
result Showed connections between mathematical principles and generative modeling techniques.
Paper introduces a new generative learning model using Schrödinger bridge diffusion in latent space.
problem Learning distributions from divergent data distributions.
method Pre-training with large-scale models, Schrödinger bridge diffusion model in latent space.
result Effective control of second-order Wasserstein distance between generated and target distributions.
Unified framework for robust, stable, and efficient density ratio estimation.
problem Density-chasm and support-chasm problems in density ratio estimation.
method Dequantified diffusion-Schrödinger bridge (D3RE) framework with DDBI and DSBI.
result Offers uniform approximation and bounded time scores in theory and empirical performance.
Generative model for time series using Schrödinger bridge.
problem Creating synthetic time series data with temporal dynamics.
method Schrödinger bridge approach for entropic interpolation via optimal transport.
result The method generates synthetic time series that respect temporal dynamics.
The study establishes bounds for Schrödinger operators on Riemannian manifolds.
problem Bounding Schrödinger operators on Riemannian manifolds.
method Utilizes weighted manifolds and Faber-Krahn inequalities to derive bounds.
result Establishes conditions for Schrödinger operators to be positive and for their spectra.
CMCD sampler connects transport and variational inference for efficient sampling.
problem Efficient sampling and generative modeling in Bayesian computation.
method Developed a principled framework using divergences on path space, CMCD sampler with adaptive dynamics.
result CMCD sampler outperforms competing approaches across various experiments.
In this paper, we partially settle down the long standing open problem of the finite time blow-up property about the nonlinear Schro¨dinger equations on some Riemannian manifolds like the standard 2-sphere S2 and the hyperbolic 2-space H2(−1). Using the similar idea, we establish such blow-up results on…
Characterizes Schrödinger operator boundedness on weighted Riemannian manifolds.
problem Classifying functions V for bounded Schrödinger operator Δ−V. method Investigates weighted L2-boundedness of Hodge projector. result Characterizes function V for Schrödinger operator boundedness. We give a new lower bound for the first gap λ2−λ1 of the Dirichlet eigenvalues of the Schr{ö}dinger operator on a bounded convex domain Ω in Rn or Sn and greatly sharpens the previous estimates. The new bound is explicit and computable.
Suppose that G=(V,E) is a finite graph with the vertex set V and the edge set E. Let Δ be the usual graph Laplacian. Consider the following nonlinear Schro¨dinger type equation of the form {−Δu−αu=f(x,u),u∈W1,2(V), on graph G, where $f(x…
Study shows observability for Schrödinger equations on product manifolds with specific conditions.
problem Observability of Schrödinger equations on product manifolds with product metrics.
method Proof of observability in finite time on open subsets satisfying Vertical Geometric Control Condition, under gap condition on spectrum of F(g).
result Observability on ω for the Schrödinger equation is strictly weaker than Geometric Control Condition on product of spheres.
For the spherical Laplacian on the sphere and for the Dirichlet Laplacian in the square}, Antonie Stern claimed in her PhD thesis (1924) the existence of an infinite sequence of eigenvalues whose corresponding eigenspaces contain an eigenfunction with exactly two nodal domains. These results were given complete proofs …
We solved the Schr{ö}dinger equation for a particle in a uniform magnetic field in the n-dimensional torus. We obtained a complete set of solutions for a broad class of problems; the torus T^n = R^n / Λ is defined as a quotient of the Euclidean space R^n by an arbitrary n-dimensional lattice Λ. The lattice is not neces…
The goal of this article is twofold: in a first part, we prove Gaussian estimates for the heat kernel of Schr{ö}dinger operators delta + V whose potential V is "small at infinity" in an integral sense. In a second part, we prove sharp boundedness result for the associated Riesz transform with potential d(delta+V) --1/2…
New inequalities for spectral zeta kernels on spheres and manifolds.
problem Establishing new inequalities for spectral zeta functions.
method Applying Kato's inequalities and majorisation techniques.
result Generalized Kato's comparison inequalities to higher dimensions.
New method simulates diffusion bridges using score matching.
problem Simulating diffusion bridges for statistical inference.
method Backward time representation, variational formulation, score matching.
result Effective approximation of diffusion bridges.
New algorithm learns bridged diffusion processes without time-reversals.
problem Learning bridged diffusion processes efficiently and accurately.
method Score matching with Doob's h-transform, avoiding time-reversals.
result Outperforms existing methods in learning bridged diffusion processes.
This paper tackles infinite-dimensional diffusion bridge simulation using operator learning.
problem Challenges in simulating diffusion bridges for modeling natural data due to intractable drift terms and continuous data representations.
method Merges score matching techniques with operator learning to directly learn infinite-dimensional bridges.
result Demonstrates high efficacy in simulating diffusion bridges for various applications, including real-world biological data.
Extends diffusion-based Schrödinger bridge models to handle time-dependent potentials.
problem Approximating optimal transport dynamics between two boundary distributions with a twisted Brownian motion reference.
method Introduces Twisted Schrödinger Bridge Matching (TSBM) using the Iterative Markovian Fitting (IMF) paradigm, incorporating a gradient-dependent bridge-matching loss.
result Improves trajectory inference across high-dimensional settings, including crowd navigation and single-cell data.
We develop underdamped diffusion bridges for sampling from unnormalized densities.
problem Sampling from unnormalized densities without direct access to samples.
method Underdamped diffusion bridges with rigorous score matching equivalence.
result State-of-the-art performance in sampling across various problems.
Method infers parameters in complex diffusion processes.
problem Parameter inference in high-dimensional, non-linear diffusion processes.
method Differentiable score matching to approximate diffusion bridges, used in an importance sampler.
result Numerically stable framework for parameter inference and diffusion mean estimation.
New algorithm preserves transport maps for better diffusion model training.
problem Training diffusion models with task-specific optimality structures.
method Generalized Schrödinger Bridge Matching (GSBM), inspired by conditional stochastic optimal control.
result GSBM better preserves transport maps, enabling stable convergence and improved scalability.
New algorithm improves on existing methods for solving transport problems.
problem Finding a map to transport one distribution to another.
method Iterative Markovian Fitting (IMF) and Diffusion Schrödinger Bridge Matching (DSBM).
result DSBM significantly improves over previous SB numerics and recovers various transport methods.
New method for sampling diffusion bridges on sub-Riemannian manifolds.
problem Sampling conditioned diffusion processes on sub-Riemannian manifolds is challenging.
method Score matching for machine learning, adapted to non-holonomic frames.
result Demonstrated method works on Heisenberg group and other sub-Riemannian manifolds.
This paper provides guarantees for DFM models using KL divergence.
problem Ensuring generative models match target distributions efficiently.
method Using KL divergence and Brownian motion bridge for generative models.
result Non-asymptotic guarantees for DFM models under specific conditions.
New approach to control diffusion processes with soft constraints.
problem Finding an optimal diffusion process with a target terminal distribution.
method Generalized Schrödinger bridge problem with soft constraints, solving for a geometric mixture of target and other distributions.
result The terminal distribution of the optimally controlled process is a geometric mixture of the target and another distribution.
ASBS improves sampling from Boltzmann distributions without importance weighting.
problem Sampling from Boltzmann distributions with known energies but unknown samples.
method Adjoint Schrödinger Bridge Sampler using kinetic-optimal transportation.
result ASBS achieves scalable and efficient sampling without importance weighting.
DDS samples from noisy data by reversing diffusion, providing theoretical guarantees.
problem Sampling from unnormalized densities.
method Denoising diffusion process, score matching, optimal control, Schrödinger bridges.
result DDS provides theoretical guarantees for sampling.
BM2 learns Schrödinger bridges using neural networks.
problem Learning dynamic transport maps between two distributions.
method Coupled Bridge Matching (BM2) with neural networks. result Preliminary theoretical analysis and numerical experiments show BM2's effectiveness. InfoBridge uses diffusion bridges to estimate mutual information accurately.
problem Estimating mutual information between random variables.
method Formulated mutual information estimation as a domain transfer problem using diffusion bridge models.
result Demonstrated unbiased estimator for various data types.
I2SB learns nonlinear diffusion processes between images.
problem Image restoration tasks, especially with limited structural information.
method Conditional diffusion models, Schrödinger bridge approach.
result I2SB outperforms standard models in various image restoration tasks. New method modifies diffusions for singular rewards.
problem Handling singular rewards in diffusions.
method Malliavin calculus for non-differentiable rewards.
result Stable and reliable training of diffusions.
Augmented bridge matching preserves coupling information between distributions.
problem Preserving the original empirical pairing in flow and bridge matching processes.
method Augmenting the velocity field with initial sample point information.
result Simple modification recovers coupling information without losing Markovian property.
Generative model for time series using Schrödinger bridges with jumps.
problem Creating realistic synthetic time series from observed data.
method Entropic optimal transport, Schrödinger bridge framework, jump-diffusion process.
result Jump-diffusion Schrödinger bridge model generates more realistic time series.
Proposes TSBP for matching topological signal distributions.
problem Matching signal distributions on topological domains.
method Topological Schrödinger Bridge (TSBP) with linear topology-aware stochastic dynamics.
result Derives closed-form topological SB (TSB) for Gaussian boundary distributions.
FSBM improves matching efficiency with minimal supervision.
problem Scalability vs. minimal supervision in matching frameworks.
method FSBM uses a small portion of pre-aligned pairs as state feedback to guide non-coupled samples.
result FSBM accelerates training and enhances generalization.
Method generates i.i.d. samples from GT data using space-time mixing.
problem Generating synthetic i.i.d. samples from high-dimensional real-valued distributions.
method Space-time mixing strategies, diffusion bridges, and score-matching.
result Optimal transport from initial to target distribution.
New method boosts performance of diffusion models on discrete data like natural language.
problem Performance of diffusion models on discrete data like natural language is poor.
method Proposes score entropy, a novel loss that extends score matching to discrete spaces.
result Significantly boosts performance on language modeling tasks.
RealUID distills matching models using real data without GANs.
problem Slow inference in matching models like diffusion and flow.
method RealUID is a universal distillation framework that incorporates real data into the distillation procedure without using GANs.
result RealUID offers a simple theoretical foundation that covers previous distillation methods for Flow Matching and Diffusion models.
QDSB accelerates Schrödinger bridge learning with quantized approximations.
problem Learning generative models from unpaired samples.
method Quantized diffusion Schrödinger bridges (QDSB) using anchor-quantized distributions and cell-wise sampling.
result QDSB achieves sample quality similar to existing methods but with significantly less computational time.
This study bridges discrete and continuous state spaces using the Ehrenfest process and diffusion models.
problem Understanding the relationship between discrete and continuous state spaces in stochastic processes.
method Investigates time-continuous Markov jump processes on discrete state spaces and their correspondence to state-continuous diffusion processes.
result The time-reversal of the Ehrenfest process converges to the time-reversed Ornstein-Uhlenbeck process, bridging discrete and continuous state spaces.
Neural network approximates diffusion bridges for efficiency and robustness.
problem Efficient simulation of conditioned diffusion processes, especially rare events and multimodal distributions.
method Trains a neural network to approximate bridge dynamics, eliminating MCMC and score modeling.
result Efficient sampling of conditioned diffusion bridges at comparable cost to unconditioned process.
DSB approximates SB problem for faster generative modeling.
problem Fast generation from complex data distributions.
method Entropy-regularized optimal transport on path spaces.
result DSB yields faster convergence to data distribution.
AdaPID optimizes diffusion-based samplers by dynamically adjusting schedules.
problem Optimizing the intermediate-time dynamics in diffusion-based samplers.
method Develops a time-varying stiffness schedule using Piece-Wise-Constant (PWC) parametrizations and a hierarchical refinement approach.
result QoS-driven PWC schedules consistently improve sampling fidelity and accuracy.
Improved diffusion bridge sampling with rKL-LD loss.
problem Improving sampling from unnormalized distributions using diffusion bridges.
method Employing the rKL-LD loss instead of the Log Variance (LV) loss for diffusion bridges.
result rKL-LD consistently outperforms LV loss in diffusion bridges.
New method learns diffusion bridges for rare events.
problem Simulating rare events in diffusion processes.
method Iterative online learning based on self-consistency.
result Strong performance in various empirical settings.
WaveGrad generates high-fidelity audio using gradient estimation.
problem Generating high-fidelity audio efficiently.
method Conditional model using score matching and diffusion models, iteratively refining a Gaussian white noise signal.
result WaveGrad can generate high-fidelity audio samples using as few as six iterations.
In this paper we outline methodology to efficiently simulate (jump) diffusion bridge sample paths without discretisation error. We achieve this by considering the simulation of conditioned (jump) diffusion bridge sample paths in light of recent work developing a mathematical framework for simulating finite dimensional …