Label Propagation Through Optimal Transport
Not on the map. Why?
Abstract (arXiv)
In this paper, we tackle the transductive semi-supervised learning problem that aims to obtain label predictions for the given unlabeled data points according to Vapnik's principle. Our proposed approach is based on optimal transport, a mathematical theory that has been successfully used to address various machine learning problems, and is starting to attract renewed interest in semi-supervised learning community. The proposed approach, Optimal Transport Propagation (OTP), performs in an incremental process, label propagation through the edges of a complete bipartite edge-weighted graph, whose affinity matrix is constructed from the optimal transport plan between empirical measures defined on labeled and unlabeled data. OTP ensures a high degree of predictions certitude by controlling the propagation process using a certainty score based on Shannon's entropy. We also provide a convergence analysis of our algorithm. Experiments task show the superiority of the proposed approach over the state-of-the-art. We make our code publicly available.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 8 of its 40 references that are in the map. First posted on arXiv 1 Oct 2021.
Builds on
8 of 40 references.
References · 8
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2015Optimal Transport for Domain Adaptationcited by 457
- 2019Label Propagation for Deep Semi-supervised Learningcited by 287
- 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
- 2016Theoretical Analysis of Domain Adaptation with Optimal Transportcited by 105
- 2018Optimal Transport for Multi-source Domain Adaptation under Target Shiftcited by 67
- 2017Co-clustering through Optimal Transportcited by 13
- 2019Interactive Image Segmentation using Label Propagation through Complex Networkscited by 6
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 0; 2025: 0; 2026: 1.
3 papers.