atlas

Research map / Learning theory and algorithms / Optimal transport

A Grid Efficient Transport Optimization Model for the Wasserstein Barycenter Problem

NeurIPS 2026 · Learning theory and algorithms › Optimal transport · approach: Sinkhorn and entropic OT algorithms

Read the paperCheck your idea against 108,967 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.

Proposes GETO-LP, a linear programming formulation of the fixed-support Wasserstein barycenter problem on d-dimensional grids that reduces the variable count from O(MN^2) to O(dMN^{1+1/d}).

Problem

Computing fixed-support Wasserstein barycenters of M distributions is expensive because standard LP formulations need O(MN^2) variables, which is intractable for large grid supports.

Approach

Exploits the grid structure of the support to build a sparser LP with O(dMN^{1+1/d}) variables for the barycenter problem, instead of the dense per-pair transport plans of standard LP models.

Key results

Limitations

Experimental setup

Baselines: standard LP models for fixed-support Wasserstein barycenter

Builds on: standard LP formulation of fixed-support Wasserstein barycenter

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