Chain Rule Optimal Transport

DOI10.1007/978-3-030-65459-7_8zbMath1473.49052arXiv1812.08113OpenAlexW3136732307MaRDI QIDQ5153518

Ke Sun, Frank Nielsen

Publication date: 30 September 2021

Published in: Signals and Communication Technology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.08113

zbMATH Keywords

information geometry\(f\)-divergencesBregman divergenceoptimal transportWasserstein distancesjoint convexityRényi divergenceJensen-Shannon divergencestatistical mixturestotal variation divergence

Mathematics Subject Classification ID

Optimal transportation (49Q22)

Uses Software

• Scikit
• MNIST
• TensorFlow
• Fashion-MNIST

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Wasserstein geometry of Gaussian measures
• Bayesian prediction based on a class of shrinkage priors for location-scale models
• Information geometry and its applications
• The Frechet distance between multivariate normal distributions
• The geometry of optimal transportation
• The earth mover's distance as a metric for image retrieval
• A new class of metric divergences on probability spaces and its applicability in statistics
• The statistical Minkowski distances: closed-form formula for Gaussian mixture models
• Stability of RCD condition under concentration topology
• On the joint convexity of the Bregman divergence of matrices
• Sliced and Radon Wasserstein barycenters of measures
• Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
• On the Translocation of Masses
• Rényi Divergence and Kullback-Leibler Divergence
• A closed-form expression for the Sharma–Mittal entropy of exponential families
• The Wasserstein distance and approximation theorems
• On a Formula for the L2 Wasserstein Metric between Measures on Euclidean and Hilbert Spaces
• Properties of a Generalized Divergence Related to Tsallis Generalized Divergence
• Probabilistic distances between finite-state finite-alphabet hidden Markov models
• Learning Mixtures by Simplifying Kernel Density Estimators
• Combinatorial optimization. Theory and algorithms