arXiv (All)
open access
Exponential convergence of Sinkhorn algorithm for entropy martingale optimal transport
We prove the exponential convergence in relative entropy of the Sinkhorn algorithm for the entropy martingale optimal transport. We assume that the marginals have compact supports and are in strict convex order, the terminal marginal support is convex, and the initial marginal support lies in the re
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- From Tsallis to KL: Convergence and Error Estimates for Tsallis-Regularized Optimal Transport#974009
- Geometry and Convergence of Quadratically Regularized Optimal Transport I#1034220
- Minimax Optimality of Score-Entropy Discrete Diffusion#659197
- Minimax Optimality of Score-Entropy Discrete Diffusion#657061
- The entropic optimal (self-)transport problem: Limit distributions for decreasing regularization with application to score function estimation#179101
Record · ID 1013008
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive