Making transport more robust and interpretable by moving data through a small number of anchor points
Chi-Heng Lin, Mehdi Azabou, Eva L. Dyer
Abstract
Optimal transport (OT) is a widely used technique for distribution alignment, with applications throughout the machine learning, graphics, and vision communities. Without any additional structural assumptions on transport, however, OT can be fragile to outliers or noise, especially in high dimensions. Here, we introduce Latent Optimal Transport (LOT), a new approach for OT that simultaneously learns low-dimensional structure in data while leveraging this structure to solve the alignment task. The idea behind our approach is to learn two sets of "anchors" that constrain the flow of transport between a source and target distribution. In both theoretical and empirical studies, we show that LOT regularizes the rank of transport and makes it more robust to outliers and the sampling density. We show that by allowing the source and target to have different anchors, and using LOT to align the latent spaces between anchors, the resulting transport plan has better structural interpretability and highlights connections between both the individual data points and the local geometry of the datasets.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a7f63d3c-befc-481f-bfcf-1cb4428b1254Cited by top-tier papers7
- Keypoint-Guided Optimal Transport with Applications in Heterogeneous Domain AdaptationXiang Gu, Yucheng Yang, Wei Zeng, Jian Sun et al.NeurIPS 2022 · 43 citations
- Your contrastive learning problem is secretly a distribution alignment problemZihao Chen, Chi-Heng Lin, Ran Liu, Jingyun Xiao et al.NeurIPS 2024 · 14 citations
- Low-Rank Optimal Transport through Factor Relaxation with Latent CouplingPeter Halmos, Xinhao Liu, Julian Gold, Benjamin J. RaphaelNeurIPS 2024 · 11 citations
- Hierarchical Refinement: Optimal Transport to Infinity and BeyondPeter Halmos, Julian Gold, Xinhao Liu, Benjamin J. RaphaelICML 2025
- Feedback Schrödinger Bridge MatchingPanagiotis Theodoropoulos, Nikolaos Komianos, Vincent Pacelli, Guan-Horng Liu et al.ICLR 2025
Builds on4
- Geometric Dataset Distances via Optimal TransportDavid Alvarez-Melis, Nicolò FusiNeurIPS 2020 · 267 citations
- Learning Autoencoders with Relational RegularizationHongteng Xu, Dixin Luo, Ricardo Henao, Svati Shah et al.ICML 2020 · 47 citations
- A Swiss Army Knife for Minimax Optimal TransportSofien Dhouib, Ievgen Redko, Tanguy Kerdoncuff, Rémi Emonet et al.ICML 2020 · 21 citations
- Momentum Contrast for Unsupervised Visual Representation LearningKaiming He, Haoqi Fan, Yuxin Wu, Saining Xie et al.CVPR 2020
Related papers
- Transport Clustering: Solving Low-Rank Optimal Transport via ClusteringHenri Schmidt, Peter Halmos, Benjamin RaphaelICML 2026
- Safeguarding LLM Fine-tuning via Push-Pull Distributional AlignmentHaozhong Wang, Zhuo Li, Yibo Yang, He Zhao et al.ACL 2026 · 1 citation
- Representational Alignment Across Model Layers and Brain Regions with Multi-Level Optimal TransportShaan Shah, Meenakshi KhoslaICLR 2026 · 4 citations
- Overcoming Spurious Solutions in Semi-Dual Neural Optimal Transport: A Smoothing Approach for Learning the Optimal Transport PlanJaemoo Choi, Jaewoong Choi, Dohyun KwonICML 2025
- Sparsity-Constrained Optimal TransportTianlin Liu, Joan Puigcerver, Mathieu BlondelICLR 2023 · 3 citations
