Optimal transport: fast probabilistic approximation with exact solvers
From MaRDI portal
Recommendations
- A fast approach to optimal transport: the back-and-forth method
- Computational optimal transport. With applications to data sciences
- Multilevel optimal transport: a fast approximation of Wasserstein-1 distances
- Computations of optimal transport distance with Fisher information regularization
- Fast entropic regularized optimal transport using semidiscrete cost approximation
Cites work
- A GEOMETRIC STUDY OF WASSERSTEIN SPACES: ULTRAMETRICS
- A large deviation approach to some transportation cost inequalities
- A sparse multiscale algorithm for dense optimal transport
- Auction algorithms for network flow problems: A tutorial introduction
- Barycenters in the Wasserstein space
- Covering a ball with smaller equal balls in R^n
- scientific article; zbMATH DE number 3099866 (Why is no real title available?)
- Inference for empirical Wasserstein distances on finite spaces
- Learnability, stability and uniform convergence
- Linear and nonlinear programming.
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- Multilevel optimal transport: a fast approximation of Wasserstein-1 distances
- Nonparametric Validation of Similar Distributions and Assessment of Goodness of Fit
- On the mean speed of convergence of empirical and occupation measures in Wasserstein distance
- On the rate of convergence in Wasserstein distance of the empirical measure
- Sliced and Radon Wasserstein barycenters of measures
- Strong identifiability and optimal minimax rates for finite mixture estimation
- The earth mover's distance as a metric for image retrieval
- The phylogenetic Kantorovich-Rubinstein metric for environmental sequence samples
- Weighted Csiszár-Kullback-Pinsker inequalities and applications to transportation inequalities
Cited in
(33)- Minimax estimation of smooth optimal transport maps
- Kantorovich-Rubinstein distance and barycenter for finitely supported measures: foundations and algorithms
- A hierarchically low-rank optimal transport dissimilarity measure for structured data
- Fast Sinkhorn. I: An \(O(N)\) algorithm for the Wasserstein-1 metric
- A particle-evolving method for approximating the optimal transport plan
- Generalized unnormalized optimal transport and its fast algorithms
- A fast approach to optimal transport: the back-and-forth method
- Optimal transport between determinantal point processes and application to fast simulation
- Hybrid Wasserstein distance and fast distribution clustering
- Diagnosing forward operator error using optimal transport
- Sparse approximation of triangular transports. I: The finite-dimensional case
- Data-driven optimal transport
- Multiscale strategies for computing optimal transport
- Multi-Marginal Optimal Transport and Probabilistic Graphical Models
- Empirical regularized optimal transport: statistical theory and applications
- scientific article; zbMATH DE number 7625198 (Why is no real title available?)
- Randomized Wasserstein barycenter computation: resampling with statistical guarantees
- Approximation of optimal transport problems with marginal moments constraints
- Multilevel optimal transport: a fast approximation of Wasserstein-1 distances
- The GenCol Algorithm for High-Dimensional Optimal Transport: General Formulation and Application to Barycenters and Wasserstein Splines
- Nonequispaced fast Fourier transform boost for the Sinkhorn algorithm
- Limit distributions and sensitivity analysis for empirical entropic optimal transport on countable spaces
- Optimal Transport Approximation of 2-Dimensional Measures
- Randomized methods for computing optimal transport without regularization and their convergence analysis
- A unifying approach to distributional limits for empirical optimal transport
- Approximating optimal transport with linear programs
- Empirical optimal transport between different measures adapts to lower complexity
- Optimal transport-based displacement interpolation with data augmentation for reduced order modeling of nonlinear dynamical systems
- Unbalanced Kantorovich-Rubinstein distance, plan, and barycenter on finite spaces: a statistical perspective
- Optimal transport-inspired deep learning framework for slow-decaying Kolmogorov n-width problems: exploiting Sinkhorn loss and Wasserstein kernel
- Sparsification techniques for large-scale optimal transport problems
- Sharp convergence rates of empirical unbalanced optimal transport for spatio-temporal point processes
- Title not available (Why is no real title available?)
This page was built for publication: Optimal transport: fast probabilistic approximation with exact solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5214190)
