Sparsification techniques for large-scale optimal transport problems
From MaRDI portal
Cites work
- A geometric view of optimal transportation and generative model
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- An Optimal Transport Approach for Selecting a Representative Subsample with Application in Efficient Kernel Density Estimation
- Concerning nonnegative matrices and doubly stochastic matrices
- Efficient Approximation of Gromov-Wasserstein Distance Using Importance Sparsification
- Empirical regularized optimal transport: statistical theory and applications
- Entropic approximation of Wasserstein gradient flows
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Fréchet means and Procrustes analysis in Wasserstein space
- Gromov-Wasserstein distances and the metric approach to object matching
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 3099866 (Why is no real title available?)
- Inexact Newton Methods
- Matching code and law: achieving algorithmic fairness with optimal transport
- Mean rates of convergence of empirical measures in the Wasserstein metric
- Methods of reducing sample size in Monte Carlo computations
- Monte Carlo strategies in scientific computing
- Multi-Marginal Optimal Transport and Probabilistic Graphical Models
- On parameter estimation with the Wasserstein distance
- On the limited memory BFGS method for large scale optimization
- On the linear convergence of the multimarginal Sinkhorn algorithm
- On the rate of convergence in Wasserstein distance of the empirical measure
- On the scaling of multidimensional matrices
- Optimal transport: fast probabilistic approximation with exact solvers
- Polar factorization and monotone rearrangement of vector‐valued functions
- Projection-based techniques for high-dimensional optimal transport problems
- Quadratically regularized optimal transport
- Quadratically regularized optimal transport on graphs
- Quasi-Newton Methods, Motivation and Theory
- Randomized Algorithms for Matrices and Data
- Regularized Newton methods for convex minimization problems with singular solutions
- Sampling-based methods for multi-block optimization problems over transport polytopes
- Scaling algorithms for unbalanced optimal transport problems
- Semidual regularized optimal transport
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
- Statistical inference for Bures-Wasserstein barycenters
- Unbalanced multi-marginal optimal transport
This page was built for publication: Sparsification techniques for large-scale optimal transport problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231101)
