Decreasing Entropic Regularization Averaged Gradient for Semi-Discrete Optimal Transport
Ferdinand Genans (SU, LPSM ), Antoine Godichon-Baggioni (LPSM), Fran\c{c}ois-Xavier Vialard (LIGM), Olivier Wintenberger (LPSM)

TL;DR
This paper introduces DRAG, a stochastic gradient descent algorithm that adaptively decreases entropic regularization in semi-discrete optimal transport, leading to faster convergence and reduced bias.
Contribution
The paper provides the first theoretical analysis showing that decreasing regularization accelerates convergence in semi-discrete OT and introduces DRAG, a novel algorithm implementing this idea.
Findings
DRAG achieves $ ext{O}(1/t)$ complexity for OT cost and potential estimation.
Decreasing regularization reduces bias and accelerates convergence.
Numerical experiments confirm the practical benefits of DRAG.
Abstract
Adding entropic regularization to Optimal Transport (OT) problems has become a standard approach for designing efficient and scalable solvers. However, regularization introduces a bias from the true solution. To mitigate this bias while still benefiting from the acceleration provided by regularization, a natural solver would adaptively decrease the regularization as it approaches the solution. Although some algorithms heuristically implement this idea, their theoretical guarantees and the extent of their acceleration compared to using a fixed regularization remain largely open. In the setting of semi-discrete OT, where the source measure is continuous and the target is discrete, we prove that decreasing the regularization can indeed accelerate convergence. To this end, we introduce DRAG: Decreasing (entropic) Regularization Averaged Gradient, a stochastic gradient descent algorithm…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Markov Chains and Monte Carlo Methods · Geometric Analysis and Curvature Flows
