Paper

Partial Optimal Transport with Applications on Positive-Unlabeled Learning

Classical optimal transport problem seeks a transportation map that preserves the total mass betwenn two probability distributions, requiring their mass to be the same. This may be too restrictive in certain applications such as color or shape matching, since the distributions may have arbitrary masses and/or that only a fraction of the total mass has to be transported... (read more)

Results in Papers With Code
(↓ scroll down to see all results)