atlas

Research map / Learning theory and algorithms / Optimal transport

Expected Sliced Transport Plans

ICLR 2025 · Learning theory and algorithms › Optimal transport · approach: Transport map estimation · 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.

Proposes Expected Sliced Transport (EST) plans, built by lifting optimal 1-D plans from many projections and averaging them, and proves the induced discrepancy is a metric on discrete measures that connects to min-SWGG via a temperature parameter.

Problem

Sliced optimal transport is computationally cheap but yields no transportation plan between the original measures, limiting applications needing explicit coupling; it is unclear whether a plan from sliced transport can define a metric.

Approach

Lift each one-dimensional optimal plan back to the original space (weighting by the masses of projected points), average the lifted plans over slicing directions to get an expected sliced transport plan, and use its cost as a discrepancy; a softmax temperature over slices interpolates between uniform slicing and min-SWGG.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the expected sliced transport plan to define a distance between finite discrete probability measuresExpected Sliced Transport (EST) · Finite discrete probability measuresmetric validityHelped
Use the expected sliced transport plan instead of the optimal transport planPoint Cloud MNIST 2D interpolation · Point Cloud MNIST 2Dmass splittingMixed
Increase temperature parameter τ (ablation)Expected Sliced Transport plan · Point Cloud MNIST 2D interpolationmass splittingHelped
Increase temperature parameter τ (ablation)Expected Sliced Transport plan · Point Cloud MNIST 2D interpolationcomputation timeNo clear effect
Use EST rather than entropic OT or the outer-product planTransport plans between μ_t and ν · Weak convergence as μ_t converges to νdiscrepancyHelped
Increase temperature parameter τ when computing EST embeddings (ablation)EST transport-based embedding · Point Cloud MNIST 2D classificationembedding informativenessHurt

Surprising findings

Limitations

Experimental setup

Datasets: Point Cloud MNIST 2D

Benchmarks: Point Cloud MNIST 2D

Metrics: classification test accuracy (logistic regression on embeddi discrepancy values along Wasserstein geodesic

Baselines: exact optimal transport (W2) entropic optimal transport min-SWGG outer product plan

Builds on: sliced Wasserstein distance min-SWGG linear optimal transport embedding entropic optimal transport

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