Constrained dynamical optimal transport and its Lagrangian formulation
classification
🧮 math.OC
keywords
constraineddynamicalformulationoptimalparameterizedprobabilityproblemstransport
read the original abstract
We propose dynamical optimal transport (OT) problems constrained in a parameterized probability subset. In application problems such as deep learning, the probability distribution is often generated by a parameterized mapping function. In this case, we derive a simple formulation for the constrained dynamical OT.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.