Search papers, labs, and topics across Lattice.
1
0
Local convergence of the Sinkhorn-Knopp algorithm can be achieved with polynomial-time efficiency, challenging previous assumptions about its scaling limits.
