Diagonal Equivalence to Matrices with Prescribed Row and Column Sums

Cited in

(85)

On the scaling of multidimensional matrices
Generalized scalings satisfying linear equations
On some methods for entropy maximization and matrix scaling
An institutionalized Divvy economy
Implications of convergence rates in Sinkhorn balancing
A multi-objective interpretation of optimal transport
Auxiliary information: the raking-ratio empirical process
A generalized projective reconstruction theorem and depth constraints for projective factorization
Algorithms for proportional matrices in reals and integers
Methods for scaling to doubly stochastic form
Multi-target identity management for unknown and time-varying number of targets in clutter
Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling
A note on overrelaxation in the Sinkhorn algorithm
Applications of optimal transportation in the natural sciences. Abstracts from the workshop held February 21--27, 2021 (online meeting)
The nested Sinkhorn divergence to learn the nested distance
Accelerating the Sinkhorn-Knopp iteration by Arnoldi-type methods
The Sinkhorn algorithm, parabolic optimal transport and geometric Monge-Ampère equations
Multi-target identity management with decentralized optimal sensor scheduling
On stochasticity preserving methods for the computation of the matrix pth root
False discovery variance reduction in large scale simultaneous hypothesis tests
Second-order models for optimal transport and cubic splines on the Wasserstein Space
Scaling of matrices to achieve specified row and column sums
The spectrum of a nonlinear operator associated with a matrix
Scaling positive random matrices: concentration and asymptotic convergence
Near-linear convergence of the random Osborne algorithm for matrix balancing
An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems
Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
Entropic approximation of Wasserstein gradient flows
Scaling of symmetric matrices by positive diagonal congruence
Wasserstein dictionary learning: optimal transport-based unsupervised nonlinear dictionary learning
Generalized Sinkhorn iterations for regularizing inverse problems using optimal mass transport
Fast entropic regularized optimal transport using semidiscrete cost approximation
An entropy minimization approach to second-order variational mean-field games
Stochastic control liaisons. Richard Sinkhorn meets Gaspard Monge on a Schrödinger bridge
Multimarginal Optimal Transport with a Tree-Structured Cost and the Schrödinger Bridge Problem
Supervised optimal transport
scientific article; zbMATH DE number 7625198 (Why is no real title available?)
On the convergence rate of potentials of Brenier maps
On the linear convergence of the multimarginal Sinkhorn algorithm
Iterated Proportional Fitting Procedure and Infinite Products of Stochastic Matrices
On the existence of a scalar pressure field in the Brödinger problem
Data assimilation: the Schrödinger perspective
Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling
Iterative Bregman projections for regularized transportation problems
Scaling, reordering, and diagonal pivoting in ILU preconditionings
Convergence of entropic schemes for optimal transport and gradient flows
Making Tables Additive in the Presence of Zeros
Biwhitening Reveals the Rank of a Count Matrix
Semi-discrete optimal transport: hardness, regularization and numerical solution
Polynomial-time algorithms for multimarginal optimal transport problems with structure
A fast solver for generalized optimal transport problems based on dynamical system and algebraic multigrid
Nonequispaced fast Fourier transform boost for the Sinkhorn algorithm
The Derivatives of Sinkhorn–Knopp Converge
Limit distributions and sensitivity analysis for empirical entropic optimal transport on countable spaces
Discrete Optimal Transport with Independent Marginals is #P-Hard
Dispersion-constrained martingale Schrödinger problems and the exact joint S\&P 500/VIX smile calibration puzzle
Fast sinkhorn. II: Collinear triangular matrix and linear time accurate computation of optimal transport
The Wasserstein metric matrix and its computational property
Utility/privacy trade-off as regularized optimal transport
Algorithms for Euclidean-regularised optimal transport
Unbalanced optimal transport and maximum mean discrepancies: interconnections and rapid evaluation
Distributionally robust optimization using optimal transport for Gaussian mixture models
A Wasserstein-type metric for generic mixture models, including location-scatter and group invariant measures
Order independence and factor convergence in iterative scaling
Tree approximation of scenario processes for multistage stochastic optimization: algorithms and fast implementations
The double regularization method for capacity constrained optimal transport
Computation of robust option prices via structured multimarginal martingale optimal transport
Fast computation of optimal transport via entropy-regularized extragradient methods
Data assimilation for sign-indefinite priors: a generalization of Sinkhorn's algorithm
Solving semi-discrete optimal transport problems: star shapedeness and Newton's method
Convergence of the Sinkhorn algorithm when the Schrödinger problem has no solution
The Dyson equalizer: adaptive noise stabilization for low-rank signal detection and recovery
Near-linear runtime for a classical matrix preconditioning algorithm
Surpassing stock market's noise-nonstationarity tradeoff by causal-based domain discovery
Trajectory inference for a branching SDE model of cell differentiation via lineage tracing
A contraction theory for Sinkhorn and Schrödinger bridges via log-Sobolev inequalities
A Cornucopia of Maximum Likelihood Algorithms
Exponential convergence of general iterative proportional fitting procedures
Gaussian entropic optimal transport: Schrödinger bridges and the Sinkhorn algorithm
New trends in the stability of Sinkhorn semigroups
Wasserstein mirror gradient flow as the limit of the Sinkhorn algorithm
Using Sinkhorn in the JKO scheme adds linear diffusion
Biproportional scaling of matrices and the iterative proportional fitting procedure
The rate of convergence of Sinkhorn balancing
Copula modeling for discrete random vectors

This page was built for publication: Diagonal Equivalence to Matrices with Prescribed Row and Column Sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5550449)