Pages that link to "Item:Q3609024"

The following pages link to The Sinkhorn–Knopp Algorithm: Convergence and Applications (Q3609024):

Displaying 42 items.

• Combination of numerical and structured approaches to the construction of a second-order incomplete triangular factorization in parallel preconditioning methods (Q327049) (← links)
• Constructive quantum scaling of unitary matrices (Q513850) (← links)
• Limit points of the iterative scaling procedure (Q744663) (← links)
• The expected adjacency and modularity matrices in the degree corrected stochastic block model (Q1642900) (← links)
• On coupling particle filter trajectories (Q1702025) (← links)
• Wasserstein discriminant analysis (Q1722729) (← links)
• A novel kernel correlation model with the correspondence estimation (Q1932822) (← links)
• A low discrepancy sequence on graphs (Q1982596) (← links)
• Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling (Q2039246) (← links)
• Coupling matrix manifolds assisted optimization for optimal transport problems (Q2051257) (← links)
• Robust learning in social networks via matrix scaling (Q2060364) (← links)
• A note on overrelaxation in the Sinkhorn algorithm (Q2080817) (← links)
• A hierarchically low-rank optimal transport dissimilarity measure for structured data (Q2098781) (← links)
• Discrete gradient flow approximations of high dimensional evolution partial differential equations via deep neural networks (Q2108629) (← links)
• Applications of optimal transportation in the natural sciences. Abstracts from the workshop held February 21--27, 2021 (online meeting) (Q2131203) (← links)
• A multiscale semi-smooth Newton method for optimal transport (Q2144980) (← links)
• Accelerating the Sinkhorn-Knopp iteration by Arnoldi-type methods (Q2174200) (← links)
• Entropic regularization of continuous optimal transport problems (Q2226332) (← links)
• False discovery variance reduction in large scale simultaneous hypothesis tests (Q2241618) (← links)
• Termination of the iterative proportional fitting procedure (Q2251685) (← links)
• Fast exact hyper-graph matching with dynamic programming for spatio-temporal data (Q2353413) (← links)
• Stochastic matrix-free equilibration (Q2359773) (← links)
• Accumulation points of the iterative proportional fitting procedure (Q2392254) (← links)
• Network models and biproportional rounding for fair seat allocations in the UK elections (Q2399304) (← links)
• Towards interpreting deep neural networks via layer behavior understanding (Q2673336) (← links)
• Scaling positive random matrices: concentration and asymptotic convergence (Q2679643) (← links)
• Convolutional wasserstein distances (Q2802296) (← links)
• Arbitrarily regularizable graphs (Q3389691) (← links)
• Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment (Q4689763) (← links)
• Doubly Stochastic Normalization of the Gaussian Kernel Is Robust to Heteroskedastic Noise (Q4999363) (← links)
• Resolving issues of scaling for gramian-based input–output pairing methods (Q5068995) (← links)
• Diagonal Scalings for the Eigenstructure of Arbitrary Pencils (Q5094219) (← links)
• Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems (Q5230605) (← links)
• The contractivity of cone-preserving multilinear mappings (Q5240856) (← links)
• Continuity of f-projections and applications to the iterative proportional fitting procedure (Q5283167) (← links)
• (Q5874548) (← links)
• Biwhitening Reveals the Rank of a Count Matrix (Q5885827) (← links)
• Coseparable Nonnegative Matrix Factorization (Q6053417) (← links)
• Sliced optimal transport on the sphere (Q6070746) (← links)
• Hierarchical optimal transport for unsupervised domain adaptation (Q6097101) (← links)
• Matrix Balancing Based Interior Point Methods for Point Set Matching Problems (Q6168327) (← links)
• Utility/privacy trade-off as regularized optimal transport (Q6201932) (← links)