Skip to content
DraconiticResearch
Search Sources API
201,683 studies31 sourcesUpdated 37 min ago
PreprintarXiv licencearXiv

CyclOT: Learning Quadratic Optimal Transport Maps via Synchronized Forward-Backward Interpolants

Abstract

We study the recovery of forward and reverse quadratic optimal-transport maps from unpaired samples in high dimensions. We introduce a bidirectional neural framework in which the learned maps induce forward and backward displacement interpolants, while the training objective combines bidirectional quadratic action, discriminator-restricted Jensen-Shannon endpoint objectives, and two-sided cycle consistency. The construction requires neither precomputed sample pairings nor an explicit convex-potential parameterization. For absolutely continuous probability measures supported on a compact convex set, and under the stated generator-approximation, discriminator-richness, and minimizer-attainment conditions, we prove a population recovery theorem: for every prescribed accuracy, the sum of the corresponding L2 errors between any global minimizer and the forward and reverse quadratic Brenier maps is below that accuracy, provided the discriminator level is sufficiently large and the annealing action weight becomes sufficiently small. Moreover, the cycle loss is bounded above by λW22(μ0,μ1). Complementary results quantify approximate invertibility and show that exact endpoint Jensen-Shannon divergence and cycle consistency control missing target mass and many-to-one map collapse, respectively. Experiments on Swiss roll, MNIST, CelebA, single-cell perturbation data, and chest X-ray images evaluate endpoint fidelity, transport cost, inverse consistency, and the geometry of the induced interpolations.

Related

  1. A global stochastic maximum principle for forward-backward stochastic control systems with quadratic convex generator and unbounded terminal condition
    Ying Hu, Feng Li, Jiaqiang Wen
    HALPreprintarXiv licenceFull textOptimisation & controlHALarXiv
  2. Learning smooth dynamics via Kinematic Interpolants
    Yiheng, Jiang, Youssef Marzouk +2
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  3. Sub-Infinite Horizon Stochastic Linear-Quadratic Optimal Control Problems and Delayed Backward Riccati Equations
    Yutao Chen, Hongwei Lou, Hanxiao Wang
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  4. Learning Stabilizing Latent Feedback Controllers via Multi-Step Backward Losses
    Paul Lutkus, Lars Lindemann, Stephen Tu
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  5. Learning Kolmogorov Backward Operators for Spectral Analysis and Forecasting: A Data-Driven Variational Galerkin Framework
    Yuanchao Xu, Claire Valva, Ben Gao +1
    arXivPreprintCC BY 4.0Full textDynamical systemsarXiv
BibTeX
@misc{xu2026cyclot,
  title = {{CyclOT: Learning Quadratic Optimal Transport Maps via Synchronized Forward-Backward Interpolants}},
  author = {Shizhou Xu and Jiachen Liu and Shih-Hsin Wang and Stefan Broecker and Yuhao Huang and Bao Wang and Thomas Strohmer},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.13892},
  eprint = {2609.13892},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.13892},
}
RIS
TY  - UNPB
TI  - CyclOT: Learning Quadratic Optimal Transport Maps via Synchronized Forward-Backward Interpolants
AU  - Shizhou Xu
AU  - Jiachen Liu
AU  - Shih-Hsin Wang
AU  - Stefan Broecker
AU  - Yuhao Huang
AU  - Bao Wang
AU  - Thomas Strohmer
PY  - 2026
DA  - 2026/09/12
PB  - arXiv
DO  - 10.48550/arxiv.2609.13892
UR  - https://arxiv.org/abs/2609.13892
AB  - We study the recovery of forward and reverse quadratic optimal-transport maps from unpaired samples in high dimensions. We introduce a bidirectional neural framework in which the learned maps induce forward and backward displacement interpolants, while the training objective combines bidirectional quadratic action, discriminator-restricted Jensen-Shannon endpoint objectives, and two-sided cycle consistency. The construction requires neither precomputed sample pairings nor an explicit convex-potential parameterization. For absolutely continuous probability measures supported on a compact convex set, and under the stated generator-approximation, discriminator-richness, and minimizer-attainment conditions, we prove a population recovery theorem: for every prescribed accuracy, the sum of the corresponding L^2 errors between any global minimizer and the forward and reverse quadratic Brenier maps is below that accuracy, provided the discriminator level is sufficiently large and the annealing action weight becomes sufficiently small. Moreover, the cycle loss is bounded above by λW_2^2(μ_0,μ_1). Complementary results quantify approximate invertibility and show that exact endpoint Jensen-Shannon divergence and cycle consistency control missing target mass and many-to-one map collapse, respectively. Experiments on Swiss roll, MNIST, CelebA, single-cell perturbation data, and chest X-ray images evaluate endpoint fidelity, transport cost, inverse consistency, and the geometry of the induced interpolations.
ER  -