A min-max gradient flow with a dynamically adapted KL penalty is proposed as a particle method for approximating optimal transport couplings, with claimed convergence to the optimal plan.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Computing Optimal Transport Plans via Min-Max Gradient Flows
A min-max gradient flow with a dynamically adapted KL penalty is proposed as a particle method for approximating optimal transport couplings, with claimed convergence to the optimal plan.