Convergence rates for regularized optimal transport via quantization
From MaRDI portal
Recommendations
Cited in
(20)- Sharp convergence rates for empirical optimal transport with smooth costs
- Bilevel optimization of the Kantorovich problem and its quadratic regularization. II: Convergence analysis
- Applications of optimal transportation. Abstracts from the workshop held February 4--9, 2024
- Stability and sample complexity of divergence regularized optimal transport
- Asymptotics of the quantization problem on metric measure spaces
- Sparsity of quadratically regularized optimal transport: bounds on concentration and bias
- Tight stability bounds for entropic Brenier maps
- An Eulerian approach to regularized JKO scheme with low-rank tensor decompositions for Bayesian inversion
- Fitted value iteration methods for bicausal optimal transport
- Monotonicity in quadratically regularized linear programs
- Quantitative convergence of quadratically regularized linear programs
- Quadratically regularized optimal transport: existence and multiplicity of potentials
- Convergence rates of the regularized optimal transport: disentangling suboptimality and entropy
- Convergence rate of entropy-regularized multi-marginal optimal transport costs
- On the sample complexity of entropic optimal transport
- A uniform rate of convergence for the entropic potentials in the quadratic euclidean setting
- Error estimates for deterministic empirical approximations of probability measures
- Stability bounds for smooth optimal transport maps and their statistical implications
- Wasserstein mirror gradient flow as the limit of the Sinkhorn algorithm
- Sparsity of quadratically regularized optimal transport: scalar case
This page was built for publication: Convergence rates for regularized optimal transport via quantization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563032)
