arXiv (All)
open access
SinkSLOT: Sinkhorn via Sparse Lifted Optimal Transport
Entropic optimal transport (EOT) has been shown to offer a computationally tractable approximation to exact optimal transport. However, the standard Sinkhorn-Knopp algorithm has two main limitations. First, given discrete measures with $N$ points, each iteration requires $O(N^2)$ operations, which r
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
- SinkSLOT: Sinkhorn via Sparse Lifted Optimal Transport#788283
- SinkSLOT: Sinkhorn via Sparse Lifted Optimal Transport#618572
- Sobolev Gradient Ascent for Optimal Transport: Barycenter Optimization and Convergence Analysis#153063
- TBR: Transport-Based Rendering with Deposition Strokes for Inverse Graphics#999314
- The Generalized Excursion Coupling as the Limit of Concave Optimal Transport#1071364
Record · ID 792283
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