REVIEW 2 cited by
Recent Advances in Optimal Transport for Machine Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Recently, Optimal Transport has been proposed as a probabilistic framework in Machine Learning for comparing and manipulating probability distributions. This is rooted in its rich history and theory, and has offered new solutions to different problems in machine learning, such as generative modeling and transfer learning. In this survey we explore contributions of Optimal Transport for Machine Learning over the period 2012 -- 2023, focusing on four sub-fields of Machine Learning: supervised, unsupervised, transfer and reinforcement learning. We further highlight the recent development in computational Optimal Transport and its extensions, such as partial, unbalanced, Gromov and Neural Optimal Transport, and its interplay with Machine Learning practice.
Forward citations
Cited by 2 Pith papers
-
Fused Gromov-Wasserstein Variance Decomposition with Linear Optimal Transport
Squared Wasserstein, Gromov-Wasserstein, and Fused Gromov-Wasserstein distances decompose into a deterministic linear-optimal-transport component plus a residual, enabling a percentage-of-variance-explained diagnostic...
-
A dimensionality reduction technique based on the Gromov-Wasserstein distance
GW-MDS reformulates multidimensional scaling as a Gromov-Wasserstein minimization problem and shows embeddings whose pairwise distances correlate with the original ones comparably to MDS and Isomap.
Discussion (0). Continue with ORCID to comment.