mlsanityData to 7 Oct 2026

Improving Mini-batch Optimal Transport via Partial Transportation

arXiv 2108.09645 ↗First posted 22 Aug 2021stat.ML cs.LGcited by 40

Not on the map. Why?

Abstract (arXiv)

Mini-batch optimal transport (m-OT) has been widely used recently to deal with the memory issue of OT in large-scale applications. Despite their practicality, m-OT suffers from misspecified mappings, namely, mappings that are optimal on the mini-batch level but are partially wrong in the comparison with the optimal transportation plan between the original measures. Motivated by the misspecified mappings issue, we propose a novel mini-batch method by using partial optimal transport (POT) between mini-batch empirical measures, which we refer to as mini-batch partial optimal transport (m-POT). Leveraging the insight from the partial transportation, we explain the source of misspecified mappings from the m-OT and motivate why limiting the amount of transported masses among mini-batches via POT can alleviate the incorrect mappings. Finally, we carry out extensive experiments on various applications such as deep domain adaptation, partial domain adaptation, deep generative model, color transfer, and gradient flow to demonstrate the favorable performance of m-POT compared to current mini-batch methods.

Key facts. Cited by 40 papers in the map (data through 7 Oct 2026). Builds on 38 of its 68 references that are in the map. First posted on arXiv 22 Aug 2021.

Builds on

38 of 68 references.

References · 38

  1. 2014Deep Learning Face Attributes in the Wildcited by 3,679
  2. 2015Domain-Adversarial Training of Neural Networkscited by 3,023
  3. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  4. 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,181
  5. 2015Optimal Transport for Domain Adaptationcited by 457
  6. 2017VisDA: The Visual Domain Adaptation Challengecited by 432
  7. 2017Wasserstein Auto-Encoderscited by 371
  8. 2017Learning Generative Models with Sinkhorn Divergencescited by 310
  9. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 219
  10. 2018DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptationcited by 212
  11. 2019Generalized Sliced Wasserstein Distancescited by 205
  12. 2019Optimal transport mapping via input convex neural networkscited by 202
26 more
  1. 2018Partial Adversarial Domain Adaptationcited by 127
  2. 2021Unbalanced minibatch Optimal Transport; applications to Domain Adaptationcited by 123
  3. 2018Improving GANs Using Optimal Transportcited by 122
  4. 2019Max-Sliced Wasserstein Distance and its use for GANscited by 118
  5. 2018Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithmcited by 111
  6. 2018Generative Modeling using the Sliced Wasserstein Distancecited by 108
  7. 2019Learning to Transfer Examples for Partial Domain Adaptationcited by 86
  8. 2020Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptationcited by 86
  9. 2019Learning with minibatch Wasserstein : asymptotic and gradient propertiescited by 83
  10. 2020Distributional Sliced-Wasserstein and Applications to Generative Modelingcited by 69
  11. 2020Adversarial-Learned Loss for Domain Adaptationcited by 65
  12. 2015Sliced Wasserstein Kernels for Probability Distributionscited by 64
  13. 2021Minibatch optimal transport distances; analysis and applicationscited by 62
  14. 2020On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithmcited by 61
  15. 2019On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithmscited by 60
  16. 2020A Balanced and Uncertainty-aware Approach for Partial Domain Adaptationcited by 55
  17. 2021Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimizationcited by 50
  18. 2017Multilevel Clustering via Wasserstein Meanscited by 48
  19. 2021Point-set Distances for Learning Representations of 3D Point Cloudscited by 48
  20. 2021Wasserstein GANs Work Because They Fail (to Approximate the Wasserstein Distance)cited by 33
  21. 2018Optimal Transport: Fast Probabilistic Approximation with Exact Solverscited by 27
  22. 2019How Well Do WGANs Estimate the Wasserstein Metric?cited by 15
  23. 2021On Transportation of Mini-batches: A Hierarchical Approachcited by 15
  24. 2020Improving Relational Regularized Autoencoders with Spherical Sliced Fused Gromov Wassersteincited by 13
  25. 2019Adversarial Computation of Optimal Transport Mapscited by 12
  26. 2018Probabilistic Multilevel Clustering via Composite Transportation Distancecited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 9; 2023: 9; 2024: 7; 2025: 8; 2026: 7.

40 papers.

Sort:

By area:

  1. 2023Multisample Flow Matching: Straightening Flows with Minibatch Couplingscited by 267
  2. 2023Recent Advances in Optimal Transport for Machine Learningcited by 66
  3. 2022Unified Optimal Transport Framework for Universal Domain Adaptationcited by 57
  4. 2024Categorical Flow Matching on Statistical Manifoldscited by 43
  5. 2022Revisiting Sliced Wasserstein on Images: From Vectorization to Convolutioncited by 25
  6. 2022Hierarchical Sliced Wasserstein Distancecited by 23
  7. 2022Kantorovich Strikes Back! Wasserstein GANs are not Optimal Transport?cited by 19
  8. 2022Amortized Projection Optimization for Sliced Wasserstein Generative Modelscited by 17
  9. 2023Markovian Sliced Wasserstein Distances: Beyond Independent Projectionscited by 11
  10. 2024Revisiting Deep Audio-Text Retrieval Through the Lens of Transportationcited by 10
  11. 2022Approximating 1-Wasserstein Distance with Treescited by 9
  12. 2022InfoOT: Information Maximizing Optimal Transportcited by 9
28 more
  1. 2024Accelerating Sinkhorn Algorithm with Sparse Newton Iterationscited by 9
  2. 2023Linear Optimal Partial Transport Embeddingcited by 8
  3. 2025Hierarchical Refinement: Optimal Transport to Infinity and Beyondcited by 8
  4. 2023On Partial Optimal Transport: Revising the Infeasibility of Sinkhorn and Efficient Gradient Methodscited by 7
  5. 2024Prototypical Partial Optimal Transport for Universal Domain Adaptationcited by 7
  6. 2025AlignFlow: Improving Flow-based Generative Models with Semi-Discrete Optimal Transportcited by 6
  7. 2023Group-blind optimal transport to group parity and its constrained variantscited by 4
  8. 2025Prompt-OT: An Optimal Transport Regularization Paradigm for Knowledge Preservation in Vision-Language Model Adaptationcited by 4
  9. 2023Interpolation for Robust Learning: Data Augmentation on Wasserstein Geodesicscited by 3
  10. 2024A Sinkhorn-type Algorithm for Constrained Optimal Transportcited by 3
  11. 2024SemRoDe: Macro Adversarial Training to Learn Representations That are Robust to Word-Level Attackscited by 3
  12. 2025ContinualFlow: Learning and Unlearning with Neural Flow Matchingcited by 3
  13. 2023Graph Matching Optimization Network for Point Cloud Registrationcited by 2
  14. 2023A Unified Framework for Unsupervised Domain Adaptation based on Instance Weightingcited by 2
  15. 2025Partial Domain Adaptation via Importance Sampling-based Shift Correctioncited by 2
  16. 2026COT-FM: Cluster-wise Optimal Transport Flow Matchingcited by 2
  17. 2026Amortized Optimal Transport from Sliced Potentialscited by 2
  18. 2026Geometry-Aware Image Flow Matchingcited by 2
  19. 2022On the Convergence of Semi-Relaxed Sinkhorn with Marginal Constraint and OT Distance Gapscited by 1
  20. 2024Partial Distribution Matching via Partial Wasserstein Adversarial Networkscited by 1
  21. 2022A Reproducible and Realistic Evaluation of Partial Domain Adaptation Methodscited by 0
  22. 2025Partial Distribution Alignment via Adaptive Optimal Transportcited by 0
  23. 2025Soft-Masked Semi-Dual Optimal Transport for Partial Domain Adaptationcited by 0
  24. 2025Theoretical Performance Guarantees for Partial Domain Adaptation via Partial Optimal Transportcited by 0
  25. 2026Locality-aware Private Class Identification for Domain Adaptation with Extreme Label Shiftcited by 0
  26. 2026QDSB: Quantized Diffusion Schr"odinger Bridgescited by 0
  27. 2026Take It or Leave It: Intent-Controlled Partial Optimal Transportcited by 0
  28. 2026Conformal Risk Minimization for Semi-Supervised Domain Adaptation via Optimal Transportcited by 0