AI Paper Atlas

Research map / Learning theory and algorithms / Optimal transport

Efficient Algorithms for Robust and Partial Semi-Discrete Optimal Transport

Pankaj K Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Keegan Yao

NeurIPS 2025 · Learning theory and algorithms › Optimal transport · approach: Sinkhorn and entropic OT algorithms · 0 citations (OpenAlex)

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.

Studies robust and partial variants of semi-discrete optimal transport in R^d, giving efficient algorithms for the alpha-partial transport and lambda-TV-robust formulations.

Problem

Optimal transport is sensitive to noise, so robust variants (partial transport with mass alpha, and TV-regularized robust OT) are needed; the paper targets efficient computation for these in the semi-discrete setting in R^d.

Approach

Studies two robust semi-discrete OT formulations: alpha-optimal partial transport (transport only a mass alpha) and lambda-robust OT (TV-distance regularization), and develops efficient algorithms for them. Full method details are unavailable from the abstract provided.

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