Stability and sample complexity of divergence regularized optimal transport
From MaRDI portal
Publication:6632602
DOI10.3150/24-BEJ1725MaRDI QIDQ6632602
Erhan Bayraktar, Xin Zhang, Stephan Eckstein
Publication date: 5 November 2024
Published in: Bernoulli (Search for Journal in Brave)
Mathematical programming (90Cxx) Miscellaneous topics in calculus of variations and optimal control (49Nxx) Manifolds and measure-geometric topics (49Qxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational Optimal Transport: With Applications to Data Science
- On the rate of convergence in Wasserstein distance of the empirical measure
- From the Schrödinger problem to the Monge-Kantorovich problem
- Weighted Csiszár-Kullback-Pinsker inequalities and applications to transportation inequalities
- On the scaling of multidimensional matrices
- I-divergence geometry of probability distributions and minimization problems
- Asymptotic analysis of the exponential penalty trajectory in linear programming
- On the empirical estimation of integral probability metrics
- Foundations of quantization for probability distributions
- A formula for the time derivative of the entropic cost and applications
- Computation of optimal transport and related hedging problems via penalization and neural networks
- Second order differentiation formula on \(\mathsf{RCD}^*(K,N)\) spaces
- Quadratically regularized optimal transport
- Entropic optimal transport: convergence of potentials
- Orlicz space regularization of continuous optimal transport problems
- Stability of entropic optimal transport and Schrödinger bridges
- An optimal transport approach for the Schrödinger bridge problem and convergence of Sinkhorn algorithm
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
- Concerning nonnegative matrices and doubly stochastic matrices
- Convergence rate of general entropic optimal transport costs
- Rectifiability of Optimal Transportation Plans
- Quadratically Regularized Optimal Transport on Graphs
- Integral Probability Metrics and Their Generating Classes of Functions
- Empirical Regularized Optimal Transport: Statistical Theory and Applications
- Quantitative Stability of Regularized Optimal Transport and Convergence of Sinkhorn's Algorithm
- Empirical measures: regularity is a counter-curse to dimensionality
- A Differential Approach to the Multi-Marginal Schrödinger System
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
- The Speed of Mean Glivenko-Cantelli Convergence
- Convergence of Entropic Schemes for Optimal Transport and Gradient Flows
- Robust risk aggregation with neural networks
- Semi-discrete optimal transport: hardness, regularization and numerical solution
- Stability of Schrödinger potentials and convergence of Sinkhorn's algorithm
- Quantitative uniform stability of the iterative proportional fitting procedure
- Sharp convergence rates for empirical optimal transport with smooth costs
- An Improved Central Limit Theorem and Fast Convergence Rates for Entropic Transportation Costs
- Entropic Optimal Transport on Random Graphs
- Limit theorems for entropic optimal transport maps and Sinkhorn divergence
- Towards optimal running timesfor optimal transport
- Convergence rates for regularized optimal transport via quantization
- Limit distribution theory for \(f\)-divergences
This page was built for publication: Stability and sample complexity of divergence regularized optimal transport
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632602)