Information geometry for regularized optimal transport and barycenters of patterns
DOI10.1162/NECO_A_01178zbMATH Open1478.53020OpenAlexW2921069803WikidataQ92441372 ScholiaQ92441372MaRDI QIDQ5154148FDOQ5154148
Authors: Ryo Karakida, Masafumi Oizumi, Marco Cuturi, Shun-Ichi Amari 
Publication date: 1 October 2021
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco_a_01178
Recommendations
divergenceoptimal transportationprobability distributionsWasserstein geometryentropic regularization
Optimal transportation (49Q22) Distribution theory (60E99) Differential geometric aspects of statistical manifolds and information geometry (53B12) Information geometry (statistical aspects) (62B11)
Cites Work
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- Barycenters in the Wasserstein space
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- Title not available (Why is that?)
- Iterative Bregman projections for regularized transportation problems
- Information geometry and its applications
- Information geometry connecting Wasserstein distance and Kullback-Leibler divergence via the entropy-relaxed transportation problem
- A smoothed dual approach for variational Wasserstein problems
Cited In (15)
- Wasserstein statistics in one-dimensional location scale models
- Wasserstein statistics in one-dimensional location-scale models
- A geometric perspective on regularized optimal transport
- Information geometry
- Optimal transportation plans with escort entropy regularization
- Information geometry of Wasserstein divergence
- Pseudo-Riemannian geometry encodes information geometry in optimal transport
- Clustering patterns connecting COVID-19 dynamics and human mobility using optimal transport
- Fisher information geometry of the barycenter map
- Transport information Bregman divergences
- Information geometry of Wasserstein statistics on shapes and affine deformations
- When optimal transport meets information geometry
- Information Geometry
- Information geometry connecting Wasserstein distance and Kullback-Leibler divergence via the entropy-relaxed transportation problem
- Limit distributions and sensitivity analysis for empirical entropic optimal transport on countable spaces
This page was built for publication: Information geometry for regularized optimal transport and barycenters of patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154148)
