Research map / Learning theory and algorithms / Optimal transport
On Computing Diverse Solutions in the Earth Movers Distance
Aritra Banik, Mayank Goswami, Abhishek Sahu
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
The paper studies computing diverse solutions to the Earth Mover's Distance (Wasserstein distance) problem, motivated by its uses in NLP and ML.
Problem
Earth Mover's Distance is widely used in NLP and ML for comparing embedding sets, training dynamics, and distributionally robust optimization, but the abstract alone does not specify the precise gap addressed.
Approach
Abstract only gives motivation; the specific technical contribution (computing multiple diverse EMD solutions) is inferred from the title and not stated in the provided text.
Closest papers by meaning
- Linear-Complexity Data-Parallel Earth Mover’s Distance Approximations (ICML 2019 · similarity 0.90)
- Linear Relaxations for Finding Diverse Elements in Metric Spaces (NeurIPS 2016 · similarity 0.88)
- A Direct tilde{O}(1/epsilon) Iteration Parallel Algorithm for Optimal Transport (NeurIPS 2019 · similarity 0.88)
- Learning Distances from Data with Normalizing Flows and Score Matching (ICML 2025 · similarity 0.85)
- MetricEmbedding: Accelerate Metric Nearness by Tropical Inner Product (ICML 2025 · similarity 0.85)
- Scalable Approximation Algorithms for $p$-Wasserstein Distance and Its Variants (ICML 2025 · similarity 0.84)
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.
