Linear optimal partial transport embedding
Yikun Bai, Ivan Vladimir Medri, Rocio Diaz Martin, Rana Muhammad Shahroz Khan, Soheil Kolouri
Abstract
Optimal transport (OT) has gained popularity due to its various applications in fields such as machine learning, statistics, and signal processing. However, the balanced mass requirement limits its performance in practical problems. To address these limitations, variants of the OT problem, including unbalanced OT, Optimal partial transport (OPT), and Hellinger Kantorovich (HK), have been proposed. In this paper, we propose the Linear optimal partial transport (LOPT) embedding, which extends the (local) linearization technique on OT and HK to the OPT problem. The proposed embedding allows for faster computation of OPT distance between pairs of positive measures. Besides our theoretical contributions, we demonstrate the LOPT embedding technique in point-cloud interpolation and PCA analysis. Our code is available at https://github.com/Baio0/LinearOPT .
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 e5bd4ef9-e379-487a-93dd-9cf233f170f4Cited by top-tier papers3
- By Tying Embeddings You Are Assuming the Distributional HypothesisFrancesco Bertolotti, Walter CazzolaICML 2024 · 4 citations
- Linear Partial Gromov-Wasserstein EmbeddingYikun Bai, Abihith Kothapalli, Hengrong Du, Rocio Diaz Martin et al.ICLR 2025
- Geometry-Aware Dataset Condensation for Diffusion Model TrainingXiao Cui, Yulei Qin, Mo Zhu, Wengang Zhou et al.ICML 2026
Builds on9
- Unbalanced minibatch Optimal Transport; applications to Domain AdaptationKilian Fatras, Thibault Séjourné, Rémi Flamary, Nicolas CourtyICML 2021 · 183 citations
- Faster Wasserstein Distance Estimation with the Sinkhorn DivergenceLénaïc Chizat, Pierre Roussillon, Flavien Léger, François-Xavier Vialard et al.NeurIPS 2020 · 164 citations
- Wasserstein GAN With Quadratic Transport CostHuidong Liu, Xianfeng Gu, Dimitris SamarasICCV 2019 · 104 citations
- Wasserstein Embedding for Graph LearningSoheil Kolouri, Navid NaderiAlizadeh, Gustavo K. Rohde, Heiko HoffmannICLR 2021 · 99 citations
- Improving Mini-batch Optimal Transport via Partial TransportationKhai Nguyen, Dang Nguyen, The-Anh Vu-Le, Tung Pham et al.ICML 2022 · 60 citations
Related papers
- Sliced Optimal Partial TransportYikun Bai, Bernhard Schmitzer, Matthew Thorpe, Soheil KolouriCVPR 2023
- Elastic Optimal Transport: Theory, Application, and Empirical EvaluationPei Yang, Yuhang Zhuang, Qi TanICLR 2026
- LCOT: Linear Circular Optimal TransportRocio Diaz Martin, Ivan Vladimir Medri, Yikun Bai, Xinran Liu et al.ICLR 2024 · 1 citation
- On Partial Optimal Transport: Revising the Infeasibility of Sinkhorn and Efficient Gradient MethodsAnh Duc Nguyen, Tuan Dung Nguyen, Quang Minh Nguyen, Hoang H. Nguyen et al.AAAI 2024 · 6 citations
- Partial Optimal Tranport with applications on Positive-Unlabeled LearningLaetitia Chapel, Mokhtar Z. Alaya, Gilles GassoNeurIPS 2020 · 30 citations
