Label Propagation Through Optimal Transport

10/01/2021
by   Mourad El Hamri, et al.
0

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.

READ FULL TEXT
research
03/22/2021

Regularized Optimal Transport for Dynamic Semi-supervised Learning

Semi-supervised learning provides an effective paradigm for leveraging u...
research
12/14/2021

Inductive Semi-supervised Learning Through Optimal Transport

In this paper, we tackle the inductive semi-supervised learning problem ...
research
12/04/2020

Matching Distributions via Optimal Transport for Semi-Supervised Learning

Semi-Supervised Learning (SSL) approaches have been an influential frame...
research
02/28/2017

Semi-supervised Learning based on Distributionally Robust Optimization

We propose a novel method for semi-supervised learning (SSL) based on da...
research
09/25/2017

Non-iterative Label Propagation on Optimal Leading Forest

Graph based semi-supervised learning (GSSL) has intuitive representation...
research
05/11/2023

Promise and Limitations of Supervised Optimal Transport-Based Graph Summarization via Information Theoretic Measures

Graph summarization is the problem of producing smaller graph representa...
research
08/01/2022

Beyond kNN: Adaptive, Sparse Neighborhood Graphs via Optimal Transport

Nearest neighbour graphs are widely used to capture the geometry or topo...

Please sign up or login with your details

Forgot password? Click here to reset