Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems

DOI10.1137/16M1106018zbMath1422.49034arXiv1610.06519WikidataQ127944348 ScholiaQ127944348MaRDI QIDQ5230605

Bernhard Schmitzer

Publication date: 28 August 2019

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.06519

zbMATH Keywords

convex optimizationmultiscaleoptimal transportentropy regularization

Mathematics Subject Classification ID

Related Items (37)

The Wasserstein-Fisher-Rao Metric for Waveform Based Earthquake Location ⋮ Optimal transportation, modelling and numerical simulation ⋮ Scaling algorithms for unbalanced optimal transport problems ⋮ A multiscale semi-smooth Newton method for optimal transport ⋮ Learning generative neural networks with physics knowledge ⋮ Randomized Wasserstein Barycenter Computation: Resampling with Statistical Guarantees ⋮ Stochastic saddle-point optimization for the Wasserstein barycenter problem ⋮ Stability of entropic optimal transport and Schrödinger bridges ⋮ Genetic Column Generation: Fast Computation of High-Dimensional Multimarginal Optimal Transport Problems ⋮ Entropic Regularization of NonGradient Systems ⋮ The GenCol Algorithm for High-Dimensional Optimal Transport: General Formulation and Application to Barycenters and Wasserstein Splines ⋮ Irregularity index for vector-valued morphological operators ⋮ Nonequispaced fast Fourier transform boost for the Sinkhorn algorithm ⋮ Entropic optimal transport solutions of the semigeostrophic equations ⋮ The Sinkhorn algorithm, parabolic optimal transport and geometric Monge-Ampère equations ⋮ Unnamed Item ⋮ Learning to generate Wasserstein barycenters ⋮ Matrix Balancing Based Interior Point Methods for Point Set Matching Problems ⋮ Wassmap: Wasserstein Isometric Mapping for Image Manifold Learning ⋮ Asymptotic analysis of domain decomposition for optimal transport ⋮ Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case ⋮ Optimal transport: discretization and algorithms ⋮ Computation of optimal transport and related hedging problems via penalization and neural networks ⋮ A stochastic multi-layer algorithm for semi-discrete optimal transport with applications to texture synthesis and style transfer ⋮ On the computation of Wasserstein barycenters ⋮ Inverse Optimal Transport ⋮ Coupling matrix manifolds assisted optimization for optimal transport problems ⋮ No-collision transportation maps ⋮ An entropy minimization approach to second-order variational mean-field games ⋮ Barycenters for the Hellinger--Kantorovich Distance Over $\mathbb{R}^d$ ⋮ Domain decomposition for entropy regularized optimal transport ⋮ On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows ⋮ Transfer operators from optimal transport plans for coherent set detection ⋮ A tumor growth model of Hele-Shaw type as a gradient flow ⋮ Kantorovich-Rubinstein distance and barycenter for finitely supported measures: foundations and algorithms ⋮ The Linearized Hellinger--Kantorovich Distance ⋮ Empirical Regularized Optimal Transport: Statistical Theory and Applications

Uses Software

• EMD
• MultiScaleOT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transport between RGB images motivated by dynamic optimal transport
• A sparse multiscale algorithm for dense optimal transport
• Numerical solution of the optimal transportation problem using the Monge-Ampère equation
• From the Schrödinger problem to the Monge-Kantorovich problem
• Globally optimal joint image segmentation and shape matching based on Wasserstein modes
• Dual coordinate step methods for linear network flow problems
• On the scaling of multidimensional matrices
• The auction algorithm: A distributed relaxation method for the assignment problem
• The invisible hand algorithm: solving the assignment problem with statistical physics
• Asymptotic analysis of the exponential penalty trajectory in linear programming
• A new optimal transport distance on the space of finite Radon measures
• Optimal entropy-transport problems and a new Hellinger-Kantorovich distance between positive measures
• A transportation \(L^p\) distance for signal analysis
• An interpolating distance between optimal transport and Fisher-Rao metrics
• The earth mover's distance as a metric for image retrieval
• A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
• Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
• Concerning nonnegative matrices and doubly stochastic matrices
• Optimal mass transport for registration and warping
• Convolutional wasserstein distances
• Barycenters in the Wasserstein Space
• Scaling algorithms for unbalanced optimal transport problems
• Convex Color Image Segmentation with Optimal Transport Distances
• Finding Minimum-Cost Circulations by Successive Approximation
• Entropic Approximation of Wasserstein Gradient Flows
• A Numerical Algorithm forL₂Semi-Discrete Optimal Transport in 3D
• A generalized model for optimal transport of images including dissipation and density modulation
• The Sinkhorn–Knopp Algorithm: Convergence and Applications
• Polar factorization and monotone rearrangement of vector‐valued functions
• The Variational Formulation of the Fokker--Planck Equation
• Iterative Bregman Projections for Regularized Transportation Problems
• Convergence of Entropic Schemes for Optimal Transport and Gradient Flows
• Convex analysis and monotone operator theory in Hilbert spaces
• Optimal Transport

This page was built for publication: Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems