The Sinkhorn–Knopp Algorithm: Convergence and Applications
From MaRDI portal
Publication:3609024
DOI10.1137/060659624zbMath1166.15301OpenAlexW2079639858MaRDI QIDQ3609024
Publication date: 6 March 2009
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060659624
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Positive matrices and their generalizations; cones of matrices (15B48) Numerical computation of matrix norms, conditioning, scaling (65F35) Stochastic matrices (15B51)
Related Items
Stochastic matrix-free equilibration, Biwhitening Reveals the Rank of a Count Matrix, Continuity of f-projections and applications to the iterative proportional fitting procedure, Applications of optimal transportation in the natural sciences. Abstracts from the workshop held February 21--27, 2021 (online meeting), A multiscale semi-smooth Newton method for optimal transport, The expected adjacency and modularity matrices in the degree corrected stochastic block model, Combination of numerical and structured approaches to the construction of a second-order incomplete triangular factorization in parallel preconditioning methods, Resolving issues of scaling for gramian-based input–output pairing methods, Accumulation points of the iterative proportional fitting procedure, Network models and biproportional rounding for fair seat allocations in the UK elections, Accelerating the Sinkhorn-Knopp iteration by Arnoldi-type methods, Diagonal Scalings for the Eigenstructure of Arbitrary Pencils, Towards interpreting deep neural networks via layer behavior understanding, A novel kernel correlation model with the correspondence estimation, Coseparable Nonnegative Matrix Factorization, Sliced optimal transport on the sphere, Scaling positive random matrices: concentration and asymptotic convergence, Hierarchical optimal transport for unsupervised domain adaptation, Unnamed Item, Matrix Balancing Based Interior Point Methods for Point Set Matching Problems, Utility/privacy trade-off as regularized optimal transport, On coupling particle filter trajectories, Wasserstein discriminant analysis, Entropic regularization of continuous optimal transport problems, A low discrepancy sequence on graphs, False discovery variance reduction in large scale simultaneous hypothesis tests, Constructive quantum scaling of unitary matrices, Termination of the iterative proportional fitting procedure, Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment, Convolutional wasserstein distances, Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling, Limit points of the iterative scaling procedure, Coupling matrix manifolds assisted optimization for optimal transport problems, Arbitrarily regularizable graphs, Robust learning in social networks via matrix scaling, Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems, The contractivity of cone-preserving multilinear mappings, A note on overrelaxation in the Sinkhorn algorithm, Doubly Stochastic Normalization of the Gaussian Kernel Is Robust to Heteroskedastic Noise, A hierarchically low-rank optimal transport dissimilarity measure for structured data, Discrete gradient flow approximations of high dimensional evolution partial differential equations via deep neural networks, Fast exact hyper-graph matching with dynamic programming for spatio-temporal data
