arXiv (All)
open access
An exact and fast solution of the inverse Regularized Optimal Transport problem
Optimal transport describes the most efficient way to move mass between two distributions, given a cost matrix for moving mass between each pair of locations. Entropic optimal transport, solved via the Sinkhorn algorithm, is a widely used regularized version of this problem. Its inverse problem asks
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
- Sliced-Regularized Optimal Transport#1116256
- Dual-guided Hierarchical Edge Localization for Large-scale Optimal Transport Across Dimensions#1070518
- SWAP: A Scalable, Warm-Startable, Anytime Permutation Solver for Optimal Transport#1064579
- Constrained optimal transport with applications to large matching markets#609898
- InfoOT: Information Maximizing Optimal Transport#643861
Record · ID 821231
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