Convolutional wasserstein distances

From MaRDI portal
Publication:2802296

DOI10.1145/2766963zbMath1334.68267OpenAlexW2009172320MaRDI QIDQ2802296

Andy Nguyen, Justin Solomon, Marco Cuturi, Fernando de Goes, Gabriel Peyré, Tao Du, Adrian Butscher, Leonidas J. Guibas

Publication date: 25 April 2016

Published in: ACM Transactions on Graphics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2766963



Related Items

Kernel Approximation on Algebraic Varieties, Geometric Averages of Partitioned Datasets, Entropic optimal transport is maximum-likelihood deconvolution, A Framework for Wasserstein-1-Type Metrics, Entropic Approximation of Wasserstein Gradient Flows, Scaling algorithms for unbalanced optimal transport problems, Stochastic approximation versus sample average approximation for Wasserstein barycenters, Wasserstein Barycenters Are NP-Hard to Compute, Randomized Wasserstein Barycenter Computation: Resampling with Statistical Guarantees, Semidual Regularized Optimal Transport, Approximate Wasserstein attraction flows for dynamic mass transport over networks, Limit laws for empirical optimal solutions in random linear programs, A linear finite-difference scheme for approximating randers distances on cartesian grids, A second order equation for Schrödinger bridges with applications to the hot gas experiment and entropic transportation cost, Semi-discrete optimal transport: hardness, regularization and numerical solution, Polynomial-time algorithms for multimarginal optimal transport problems with structure, Optimal Estimation of Wasserstein Distance on a Tree With an Application to Microbiome Studies, Estimation of Wasserstein distances in the spiked transport model, Regularity of optimal mapping between hypercubes, Preconditioning of Optimal Transport, Transport Monte Carlo: High-Accuracy Posterior Approximation via Random Transport, A family of pairwise multi-marginal optimal transports that define a generalized metric, On quantum optimal transport, Automatically Controlled Morphing of 2D Shapes with Textures, Manifold learning for coherent design interpolation based on geometrical and topological descriptors, The Sinkhorn algorithm, parabolic optimal transport and geometric Monge-Ampère equations, Unnamed Item, Unnamed Item, Entropic Optimal Transport on Random Graphs, Discrete Optimal Transport with Independent Marginals is #P-Hard, Learning to generate Wasserstein barycenters, Unnamed Item, Fast convergence of empirical barycenters in Alexandrov spaces and the Wasserstein space, Optimal Transport Approximation of 2-Dimensional Measures, The Wasserstein metric matrix and its computational property, Quantitative stability of barycenters in the Wasserstein space, Distributionally robust chance constrained SVM model with \(\ell_2\)-Wasserstein distance, Stochastic distance transform: theory, algorithms and applications, Convex histogram-based joint image segmentation with regularized optimal transport cost, A transportation \(L^p\) distance for signal analysis, Displacement Interpolation Using Monotone Rearrangement, Simple approximative algorithms for free-support Wasserstein barycenters, An optimal transport approach for the Schrödinger bridge problem and convergence of Sinkhorn algorithm, Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case, Elements of Statistical Inference in 2-Wasserstein Space, Multilevel Optimal Transport: A Fast Approximation of Wasserstein-1 Distances, Optimal transport: discretization and algorithms, Fréchet means and Procrustes analysis in Wasserstein space, Information Geometry for Regularized Optimal Transport and Barycenters of Patterns, A Smoothed Dual Approach for Variational Wasserstein Problems, Convergence of Entropic Schemes for Optimal Transport and Gradient Flows, Projection-based reduced order models for a cut finite element method in parametrized domains, Computation of optimal transport and related hedging problems via penalization and neural networks, Unnamed Item, CytOpT: Optimal Transport with Domain Adaptation for Interpreting Flow Cytometry data, Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary Learning, A stochastic multi-layer algorithm for semi-discrete optimal transport with applications to texture synthesis and style transfer, An Algorithm for Optimal Transport between a Simplex Soup and a Point Cloud, Central limit theorems for entropy-regularized optimal transport on finite spaces and statistical applications, Ground metric learning on graphs, Fast Entropic Regularized Optimal Transport Using Semidiscrete Cost Approximation, A Smoothed Dual Approach for Variational Wasserstein Problems, Empirical optimal transport on countable metric spaces: distributional limits and statistical applications, Minimax estimation of smooth optimal transport maps, On the computation of Wasserstein barycenters, Coupling matrix manifolds assisted optimization for optimal transport problems, Optimal transport, mean partition, and uncertainty assessment in cluster analysis, Empirical geodesic graphs and CAT\((k)\) metrics for data analysis, Domain decomposition for entropy regularized optimal transport, Global regularity for the Monge-Ampère equation with natural boundary condition, On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows, Geometry-Sensitive Ensemble Mean Based on Wasserstein Barycenters: Proof-of-Concept on Cloud Simulations, Reduced-order model for the BGK equation based on POD and optimal transport, Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems, Stochastic Control Liaisons: Richard Sinkhorn Meets Gaspard Monge on a Schrödinger Bridge, Surrogate parametric metamodel based on optimal transport, Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance, Quantum entropic regularization of matrix-valued optimal transport, Conditional density estimation and simulation through optimal transport, Multimarginal Optimal Transport with a Tree-Structured Cost and the Schrödinger Bridge Problem, Unnamed Item, Kantorovich-Rubinstein distance and barycenter for finitely supported measures: foundations and algorithms, A hierarchically low-rank optimal transport dissimilarity measure for structured data


Uses Software


Cites Work