Interpolating between Optimal Transport and KL regularized Optimal Transport using R\'enyi Divergences
Jonas Bresch, Viktor Stein

TL;DR
This paper introduces a new family of regularized optimal transport methods using Renyi divergences, which interpolate between unregularized and KL-regularized OT, offering improved stability and performance.
Contribution
It proposes Renyi divergence-based regularization for OT, providing a flexible interpolation between unregularized and KL-regularized OT with convergence guarantees.
Findings
Renyi regularized OT outperforms KL and Tsallis regularized OT in experiments.
The method better approximates unregularized OT plans.
It improves inference tasks by recovering ground truth more accurately.
Abstract
Regularized optimal transport (OT) has received much attention in recent years starting from Cuturi's introduction of Kullback-Leibler (KL) divergence regularized OT. In this paper, we propose regularizing the OT problem using the family of -R\'enyi divergences for . R\'enyi divergences are neither -divergences nor Bregman distances, but they recover the KL divergence in the limit . The advantage of introducing the additional parameter is that for we obtain convergence to the unregularized OT problem. For the KL regularized OT problem, this was achieved by letting the regularization parameter tend to zero, which causes numerical instabilities. We present two different ways to obtain premetrics on probability measures, namely by R\'enyi divergence constraints and by penalization. The latter…
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Neural Networks and Applications · Machine Learning and Algorithms
