Making transport more robust and interpretable by moving data through a small number of anchor points
Chi-Heng Lin, Mehdi Azabou, Eva L. Dyer
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper7
- Keypoint-Guided Optimal Transport with Applications in Heterogeneous Domain AdaptationXiang Gu, Yucheng Yang, Wei Zeng, Jian Sun 等NeurIPS 2022 · 被引用 43 次
- Your contrastive learning problem is secretly a distribution alignment problemZihao Chen, Chi-Heng Lin, Ran Liu, Jingyun Xiao 等NeurIPS 2024 · 被引用 14 次
- Low-Rank Optimal Transport through Factor Relaxation with Latent CouplingPeter Halmos, Xinhao Liu, Julian Gold, Benjamin J. RaphaelNeurIPS 2024 · 被引用 11 次
- 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 等ICLR 2025
它引用的顶会 Paper4
- Geometric Dataset Distances via Optimal TransportDavid Alvarez-Melis, Nicolò FusiNeurIPS 2020 · 被引用 267 次
- Learning Autoencoders with Relational RegularizationHongteng Xu, Dixin Luo, Ricardo Henao, Svati Shah 等ICML 2020 · 被引用 47 次
- A Swiss Army Knife for Minimax Optimal TransportSofien Dhouib, Ievgen Redko, Tanguy Kerdoncuff, Rémi Emonet 等ICML 2020 · 被引用 21 次
- Momentum Contrast for Unsupervised Visual Representation LearningKaiming He, Haoqi Fan, Yuxin Wu, Saining Xie 等CVPR 2020
相关 Paper
- 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 等ACL 2026 · 被引用 1 次
- Representational Alignment Across Model Layers and Brain Regions with Multi-Level Optimal TransportShaan Shah, Meenakshi KhoslaICLR 2026 · 被引用 4 次
- 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 次
