atlas

Research map / Learning theory and algorithms / Optimal transport

Learning Wasserstein Embeddings

ICLR 2018 · Learning theory and algorithms › Optimal transport · approach: Sliced Wasserstein variants · 8 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Replace repeated optimal-transport distance computation with learned Euclidean embeddingsWasserstein distance computation on MNIST · MNIST testSpeedup: x18 and x1000 on CPU; x1000 and x500 000 on GPUHelped
Train the embedding on the same dataset being evaluated rather than a different datasetDWE · Google Doodle CatMSE: 5.025 -> 1.195Helped
Train the embedding on the same dataset being evaluated rather than a different datasetDWE · Google Doodle CrabMSE: 5.532 -> 0.854Helped
Train the embedding on the same dataset being evaluated rather than a different datasetDWE · Google Doodle FacesMSE: 5.025 -> 3.158Helped
Train the embedding on the same dataset being evaluated rather than a different datasetDWE · MNISTMSE: 50.527 -> 0.405Helped
Use an embedding trained on another doodle datasetDWE · Google Doodle datasetsMSE: Cat: 1.195 vs 1.718, 2.07; Crab: 0.854 vs 1.718, 3.158; Faces: 3.158 vs 2.07, 3.158Mixed
Add a decoder reconstruction loss to the embedding objectiveDWE · Image datasetsGeneralization performanceHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy