mlsanityData to 7 Oct 2026

Sliced-Regularized Optimal Transport

arXiv 2604.23944 ↗First posted 27 Apr 2026stat.ML cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

We propose a new regularized optimal transport (OT) formulation, termed sliced-regularized optimal transport (SROT). Unlike entropic OT (EOT), which regularizes the transport plan toward an independent coupling, SROT regularizes it toward a smoothened sliced OT (SOT) plan. To the best of our knowledge, SROT is the first approach to leverage a version of SOT plan as a reference to improve classical OT. We provide a formal definition of SROT, derive its dual formulation, and provide a post-Bayesian interpretation of SROT. We then develop a Sinkhorn-style algorithm for efficient computation, retaining the same scalability advantages as EOT. By incorporating a scalable SOT plan as a prior, SROT yields more accurate approximations of the exact OT plan than EOT under the same level of regularization. Moreover, the resulting transport plan improves upon the reference SOT plan itself. We further introduce the corresponding OT divergence induced by SROT, named SROT divergence, and analyze its topological and computational properties. Finally, we validate our approach through experiments on synthetic datasets and color transfer tasks, demonstrating that SROT is better than both EOT and SOT in approximating exact OT. Additional experiments on gradient flows further highlight the advantages of SROT divergence.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 29 of its 56 references that are in the map. First posted on arXiv 27 Apr 2026.

Builds on

29 of 56 references.

References · 29

  1. 2022Flow Matching for Generative Modelingcited by 5,426
  2. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  3. 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 835
  4. 2017Learning Generative Models with Sinkhorn Divergencescited by 310
  5. 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
  6. 2023Multisample Flow Matching: Straightening Flows with Minibatch Couplingscited by 267
  7. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 219
  8. 2018DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptationcited by 212
  9. 2019Generalized Sliced Wasserstein Distancescited by 205
  10. 2016Stochastic Optimization for Large-scale Optimal Transportcited by 188
  11. 2013A General Framework for Updating Belief Distributionscited by 172
  12. 2021Plugin Estimation of Smooth Optimal Transport Mapscited by 67
17 more
  1. 2017Optimal Transport for Diffeomorphic Registrationcited by 39
  2. 2019Approximate Bayesian computation with the Wasserstein distancecited by 34
  3. 2019Orthogonal Estimation of Wasserstein Distancescited by 32
  4. 2022Sparsity-Constrained Optimal Transportcited by 32
  5. 2024Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifoldscited by 28
  6. 2022Low-rank Optimal Transport: Approximation, Statistics and Debiasingcited by 21
  7. 2026Sinkhorn-Drifting Generative Modelscited by 20
  8. 2019Subspace Detours: Building Transport Plans that are Optimal on Subspace Projectionscited by 19
  9. 2024Expected Sliced Transport Planscited by 19
  10. 2019Quadratically regularized optimal transportcited by 15
  11. 2022Rethinking Initialization of the Sinkhorn Algorithmcited by 14
  12. 2025Differentiable Generalized Sliced Wasserstein Planscited by 7
  13. 2023Fast Optimal Transport through Sliced Wasserstein Generalized Geodesicscited by 5
  14. 2025Fast Estimation of Wasserstein Distances via Regression on Sliced Wasserstein Distancescited by 5
  15. 2025Entropic optimal transport beyond product reference couplings: the Gaussian case on Euclidean spacecited by 2
  16. 2026Amortized Optimal Transport from Sliced Potentialscited by 2
  17. 2026Vertical Consensus Inference for High-Dimensional Random Partitioncited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.