arXiv (All)
open access
Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp
We revisit the Sinkhorn-Knopp (SK) algorithm for the matrix scaling problem. Despite extensive literature on the global convergence of SK and its variants, its local linear convergence behavior remains less understood. We address this gap by providing the first nonasymptotic local analysis of SK tha
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
- Strong convergence rates of stochastic theta Milstein methods for index-1 stochastic differential algebraic equations under non-globally Lipschitz conditions#1084527
- Wasserstein mixing of a systematic-scan random rotation sampler#1160766
- A Framework for Loop-Free Convergence#501143
- Stable and Online Algorithms for Random Matrix Discrepancy#1156862
- Adaptive local representations for Helmholtz Trefftz discontinuous Galerkin methods#1000242
Record · ID 1130607
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