On neural differential equations

P Kidger - arXiv preprint arXiv:2202.02435, 2022 - arxiv.org
The conjoining of dynamical systems and deep learning has become a topic of great
interest. In particular, neural differential equations (NDEs) demonstrate that neural networks …

Diffusion schrödinger bridge with applications to score-based generative modeling

V De Bortoli, J Thornton, J Heng… - Advances in Neural …, 2021 - proceedings.neurips.cc
Progressively applying Gaussian noise transforms complex data distributions to
approximately Gaussian. Reversing this dynamic defines a generative model. When the …

Diffusion Schrödinger bridge matching

Y Shi, V De Bortoli, A Campbell… - Advances in Neural …, 2024 - proceedings.neurips.cc
Solving transport problems, ie finding a map transporting one given distribution to another,
has numerous applications in machine learning. Novel mass transport methods motivated …

Multisample flow matching: Straightening flows with minibatch couplings

AA Pooladian, H Ben-Hamu, C Domingo-Enrich… - arXiv preprint arXiv …, 2023 - arxiv.org
Simulation-free methods for training continuous-time generative models construct probability
paths that go between noise distributions and individual data samples. Recent works, such …

Plugin estimation of smooth optimal transport maps

T Manole, S Balakrishnan, J Niles-Weed… - arXiv preprint arXiv …, 2021 - arxiv.org
We analyze a number of natural estimators for the optimal transport map between two
distributions and show that they are minimax optimal. We adopt the plugin approach: our …

Minimax estimation of discontinuous optimal transport maps: The semi-discrete case

AA Pooladian, V Divol… - … Conference on Machine …, 2023 - proceedings.mlr.press
We consider the problem of estimating the optimal transport map between two probability
distributions, $ P $ and $ Q $ in $\mathbb {R}^ d $, on the basis of iid samples. All existing …

Convex potential flows: Universal probability distributions with optimal transport and convex optimization

CW Huang, RTQ Chen, C Tsirigotis… - arXiv preprint arXiv …, 2020 - arxiv.org
Flow-based models are powerful tools for designing probabilistic models with tractable
density. This paper introduces Convex Potential Flows (CP-Flow), a natural and efficient …

Sliced iterative normalizing flows

B Dai, U Seljak - arXiv preprint arXiv:2007.00674, 2020 - arxiv.org
We develop an iterative (greedy) deep learning (DL) algorithm which is able to transform an
arbitrary probability distribution function (PDF) into the target PDF. The model is based on …

Optimal transport map estimation in general function spaces

V Divol, J Niles-Weed, AA Pooladian - arXiv preprint arXiv:2212.03722, 2022 - arxiv.org
We consider the problem of estimating the optimal transport map between a (fixed) source
distribution $ P $ and an unknown target distribution $ Q $, based on samples from $ Q …

Neural optimal transport with lagrangian costs

AA Pooladian, C Domingo-Enrich, RTQ Chen… - arXiv preprint arXiv …, 2024 - arxiv.org
We investigate the optimal transport problem between probability measures when the
underlying cost function is understood to satisfy a least action principle, also known as a …