REVIEW 2 cited by
Entropic approximation for multi-dimensional martingale optimal transport
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We study the existing algorithms that solve the multidimensional martingale optimal transport. Then we provide a new algorithm based on entropic regularization and Newton's method. Then we provide theoretical convergence rate results and we check that this algorithm performs better through numerical experiments. We also give a simple way to deal with the absence of convex ordering among the marginals. Furthermore, we provide a new universal bound on the error linked to entropy.
Forward citations
Cited by 2 Pith papers
-
Faster Algorithms for Multimarginal Optimal Transport
New algorithms approximate multimarginal optimal transport with near-linear classical time and sublinear quantum time in the tensor dimension, plus matching query lower bounds.
-
Multidimensional specific relative entropy between continuous martingales
A multidimensional version of specific relative entropy between continuous martingales is defined, with Gantert's inequality extended and shown to be the convex lower semicontinuous envelope of the entropy.
Discussion (0). Continue with ORCID to comment.