arXiv (All)
open access
Inexact Bregman Sparse Newton Method for Efficient Optimal Transport
Computing exact optimal transport (OT) distances at large scale remains computationally challenging. Entropy-regularized OT can be solved efficiently, but its solution is biased toward the regularized problem, and small regularization parameters often lead to slow convergence and numerical instabili
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
- An exact and fast solution of the inverse Regularized Optimal Transport problem#821231
- Sliced-Regularized Optimal Transport#1116256
- SWAP: A Scalable, Warm-Startable, Anytime Permutation Solver for Optimal Transport#1064579
- Bilevel Optimization of the Kantorovich Problem and its Quadratic Regularization Part III: The Finite-Dimensional Case#1062628
- Path-Space Optimal Transport with Interactions: Kinetic Equations and Eikonal Structure#1201767
Record · ID 1536094
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