AI Paper Atlas

Research map / Learning theory and algorithms / Optimal transport

On Computing Diverse Solutions in the Earth Movers Distance

Aritra Banik, Mayank Goswami, Abhishek Sahu

NeurIPS 2026 · Learning theory and algorithms › Optimal transport · approach: Sliced Wasserstein variants

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

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