MMD-Regularized Unbalanced Optimal Transport
Piyushi Manupriya (IIT Hyderabad, INDIA), J. Saketha Nath (IIT, Hyderabad, INDIA), Pratik Jawanpuria (Microsoft IDC, INDIA)

TL;DR
This paper introduces MMD-regularized unbalanced optimal transport (UOT), deriving duality properties, proposing a sample-efficient estimator, and demonstrating superior performance over existing methods in various applications.
Contribution
It develops a novel MMD-based regularization framework for UOT, deriving duality, proposing a finite-sample estimator with error bounds, and showing improved empirical results.
Findings
MMD-UOT induces new metrics combining ground metric and sample efficiency.
The estimator achieves an error rate of O(1/√m) without curse of dimensionality.
Experiments show MMD-UOT outperforms KL-regularized UOT and MMD in applications.
Abstract
We study the unbalanced optimal transport (UOT) problem, where the marginal constraints are enforced using Maximum Mean Discrepancy (MMD) regularization. Our work is motivated by the observation that the literature on UOT is focused on regularization based on -divergence (e.g., KL divergence). Despite the popularity of MMD, its role as a regularizer in the context of UOT seems less understood. We begin by deriving a specific dual of MMD-regularized UOT (MMD-UOT), which helps us prove several useful properties. One interesting outcome of this duality result is that MMD-UOT induces novel metrics, which not only lift the ground metric like the Wasserstein but are also sample-wise efficient to estimate like the MMD. Further, for real-world applications involving non-discrete measures, we present an estimator for the transport plan that is supported only on the given () samples.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsGroundwater flow and contamination studies · Stochastic Gradient Optimization Techniques · Adversarial Robustness in Machine Learning
