atlas

Research map / Learning theory and algorithms / Optimal transport

Minimax Optimal Estimation of Transport-Growth Pairs in Unbalanced Optimal Transport

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

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Derives minimax-optimal rates for estimating the transport-growth pair (Monge map and growth factor) in unbalanced OT with quadratic cost and KL marginal penalties, via a plan-based 1NN estimator and a cosine-kernel plug-in estimator, using a value-based stability reduction.

Problem

Statistical estimation of Monge-type objects (transport map and growth map) in unbalanced optimal transport with KL marginal penalties, where existing theory is limited to semi-dual potentials or non-Monge quantities.

Approach

Treats the population target as a transport-growth pair (T, lambda) and reduces map/growth risk to perturbations of the UOT objective value via a stability bound and first-order expansion, using a cosine (Neumann) kernel to handle boundary issues on the hypercube.

Key results

Surprising findings

Limitations

Experimental setup

Datasets: Completion3D

Benchmarks: Completion3D

Metrics: MSE empirical learning rate

Baselines: SSUOT PI-Wavelet

Builds on: unbalanced optimal transport (Gaussian-Hellinger / KL penalties) balanced OT minimax map estimation semi-dual UOT statistical rates

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