2 papers
cs.LG2026
Transport Clustering: Solving Low-Rank Optimal Transport via Clustering
Henri Schmidt, Peter Halmos, Ben Raphael
Optimal transport (OT) finds a least cost transport plan between two probability distributions using a cost matrix defined on pairs of points. Unlike standard OT, which infers unst…
cs.LG2025
Computing the Distance between unbalanced Distributions -- The flat Metric
Henri Schmidt, Christian Düll
We provide an implementation to compute the flat metric in any dimension. The flat metric, also called dual bounded Lipschitz distance, generalizes the well-known Wasserstein dista…