Pages that link to "Item:Q1121341"
From MaRDI portal
The following pages link to On the scaling of multidimensional matrices (Q1121341):
Displaying 50 items.
- Efficient numerical methods for entropy-linear programming problems (Q327229) (← links)
- Positive diagonal scaling of a nonnegative tensor to one with prescribed slice sums (Q630503) (← links)
- Order independence and factor convergence in iterative scaling (Q686367) (← links)
- The rate of convergence of Sinkhorn balancing (Q802704) (← links)
- Matrix scaling, entropy minimization, and conjugate duality. II: The dual problem (Q910459) (← links)
- An extension of a theorem of Darroch and Ratcliff in loglinear models and its application to scaling multidimensional matrices (Q1112910) (← links)
- Matrix scaling, entropy minimization, and conjugate duality. I: Existence conditions (Q1120635) (← links)
- Scalings of matrices which have prespecified row sums and column sums via optimization (Q1123947) (← links)
- Generalized scalings satisfying linear equations (Q1123948) (← links)
- On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms (Q1318656) (← links)
- Matrix scaling: A geometric proof of Sinkhorn's theorem (Q1375080) (← links)
- Penalized maximum-likelihood estimation, the Baum-Welch algorithm, diagonal balancing of symmetric matrices and applications to training acoustic data (Q1576464) (← links)
- A multi-objective interpretation of optimal transport (Q1706409) (← links)
- Auxiliary information: the raking-ratio empirical process (Q1711605) (← links)
- Generalized incompressible flows, multi-marginal transport and Sinkhorn algorithm (Q1740500) (← links)
- A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices (Q1911415) (← links)
- On the complexity of nonnegative-matrix scaling (Q1915608) (← links)
- Minimization of norms and the spectral radius of a sum of nonnegative matrices under diagonal equivalence (Q1923161) (← links)
- Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling (Q2039246) (← links)
- Domain decomposition for entropy regularized optimal transport (Q2055991) (← links)
- A note on overrelaxation in the Sinkhorn algorithm (Q2080817) (← links)
- A hierarchically low-rank optimal transport dissimilarity measure for structured data (Q2098781) (← links)
- Deep convolutional neural networks with spatial regularization, volume and star-shape priors for image segmentation (Q2103871) (← 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)
- Entropical optimal transport, Schrödinger's system and algorithms (Q2154601) (← links)
- Optimal transport problems regularized by generic convex functions: a geometric and algorithmic approach (Q2154656) (← links)
- Entropy-regularized 2-Wasserstein distance between Gaussian measures (Q2154664) (← links)
- A proof of the Caffarelli contraction theorem via entropic regularization (Q2180862) (← links)
- The Sinkhorn algorithm, parabolic optimal transport and geometric Monge-Ampère equations (Q2194042) (← links)
- An optimal transport approach for the Schrödinger bridge problem and convergence of Sinkhorn algorithm (Q2210656) (← links)
- A gradient descent perspective on Sinkhorn (Q2232779) (← links)
- False discovery variance reduction in large scale simultaneous hypothesis tests (Q2241618) (← links)
- Traversing the Schrödinger bridge strait: Robert Fortet's marvelous proof redux (Q2420768) (← links)
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm (Q2465654) (← links)
- Asymptotic analysis of domain decomposition for optimal transport (Q2690322) (← links)
- Convergence rate of general entropic optimal transport costs (Q2696596) (← links)
- Convolutional wasserstein distances (Q2802296) (← links)
- Quantum computing and hidden variables (Q3102441) (← links)
- Scaling algorithms for unbalanced optimal transport problems (Q3177709) (← links)
- Semidual Regularized Optimal Transport (Q4554909) (← links)
- Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary Learning (Q4686929) (← links)
- Generalized Sinkhorn Iterations for Regularizing Inverse Problems Using Optimal Mass Transport (Q4689648) (← links)
- Stochastic Control Liaisons: Richard Sinkhorn Meets Gaspard Monge on a Schrödinger Bridge (Q4992611) (← links)
- Spectral Analysis of Matrix Scaling and Operator Scaling (Q4997323) (← links)
- Multimarginal Optimal Transport with a Tree-Structured Cost and the Schrödinger Bridge Problem (Q5000631) (← links)
- Supervised Optimal Transport (Q5048639) (← links)
- Quantitative Stability of Regularized Optimal Transport and Convergence of Sinkhorn's Algorithm (Q5051691) (← links)
- Stochastic approximation versus sample average approximation for Wasserstein barycenters (Q5058387) (← links)
- On the Linear Convergence of the Multimarginal Sinkhorn Algorithm (Q5080502) (← links)
