Reliable Modeling of Distribution Shifts via Displacement-Reshaped Optimal Transport
Not on the map. Why?
Abstract (arXiv)
Optimal transport (OT) is a central framework for modeling distribution shifts. Because OT compares distributions directly in input space, a well-designed ground metric between observations is essential to ensure that the optimizer does not violate the true geometry of change. We propose Displacement-Reshaped Optimal Transport (ReshapeOT), a method that reshapes the ground metric by integrating observed sample displacements as an additional source of knowledge. Technically, ReshapeOT replaces the Euclidean metric with a Mahalanobis distance estimated from displacement second moments. This effectively carves expressways through the input space, inviting transport solutions that better align with observed displacements. Our method is computationally lightweight, integrates seamlessly into any OT solver that operates on a cost matrix, and can be kernelized for further flexibility. Experiments on synthetic and real-world data show that ReshapeOT achieves substantial gains in transport reliability. We further demonstrate our method's usefulness in two practical use cases.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 47 references that are in the map. First posted on arXiv 6 May 2026.
Builds on
21 of 47 references.
References · 21
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,917
- 2015Optimal Transport for Domain Adaptationcited by 463
- 2019Subspace Robust Wasserstein Distancescited by 90
- 2024Metric Flow Matching for Smooth Interpolations on the Data Manifoldcited by 77
- 2013Regularized Discrete Optimal Transportcited by 54
- 2022Meta Optimal Transportcited by 28
- 2024Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifoldscited by 28
- 2019Inverse optimal transportcited by 26
- 2022Riemannian Metric Learning via Optimal Transportcited by 21
- 2020Making transport more robust and interpretable by moving data through a small number of anchor pointscited by 18
- 2019Ground Metric Learning on Graphscited by 17
9 more
- 2020Fast and Robust Comparison of Probability Measures in Heterogeneous Spacescited by 17
- 2024Neural Optimal Transport with Lagrangian Costscited by 16
- 2022Geodesic Sinkhorn for Fast and Accurate Optimal Transport on Manifoldscited by 10
- 2017Information Geometry Connecting Wasserstein Distance and Kullback-Leibler Divergence via the Entropy-Relaxed Transportation Problemcited by 9
- 2019Learning transport cost from subset correspondencecited by 7
- 2021Learning Domain Invariant Representations by Joint Wasserstein Distance Minimizationcited by 6
- 2024Feedback Schr"odinger Bridge Matchingcited by 4
- 2024A Riemannian Approach to Ground Metric Learning for Optimal Transportcited by 3
- 2025Wasserstein Distances Made Explainable: Insights Into Dataset Shifts and Transport Phenomenacited by 2
Built on by
Not cited yet.