Bregman–Wasserstein Divergence: Geometry and Applications

The Bregman-Wasserstein divergence is the optimal transport cost when the underlying cost function is given by a Bregman divergence, and arises naturally in fields such as statistics and machine learning. We establish fundamental properties of the Bregman-Wasserstein divergence and propose a novel generalized transport geometry that promotes the Bregman geometry to the space of probability distributions. We provide a probabilistic interpretation involving exponential families and define generalized displacement interpolations compatible with the Bregman geometry. These interpolations are used to derive a generalized Pythagorean inequality, which is of independent interest. Furthermore, we construct a generalized dualistic geometry that lifts the differential geometry of the Bregman divergence to an infinite-dimensional statistical manifold. On the computational side, we demonstrate how Bregman-Wasserstein optimal transport maps can be estimated using neural approaches, establish the well-posedness of Bregman-Wasserstein barycenters, and relate them to Bayesian learning. Finally, we relate the Bregman-Wasserstein divergence to rate distortion theory, and introduce the Bregman-Wasserstein JKO scheme for discretizing Riemannian Wasserstein gradient flows.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Information Theory
Published
2025-09-05
DOI
https://doi.org/10.1109/tit.2025.3606755
Citations
1
Primary Topic
Geometric Analysis and Curvature Flows
Type
article
Field-Weighted Citation Impact
3.73

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Bregman–Wasserstein Divergence: Geometry and Applications

Cale Rankin, Amanjit Singh Kainth, Ting‐Kam Leonard Wong
1 citations
IEEE Transactions on Information Theory
Geometric Analysis and Curvature Flows
3.73
article

Bregman–Wasserstein Divergence: Geometry and Applications

Cale Rankin, Amanjit Singh Kainth, Ting‐Kam Leonard Wong
article en
1 citations

Abstract

The Bregman-Wasserstein divergence is the optimal transport cost when the underlying cost function is given by a Bregman divergence, and arises naturally in fields such as statistics and machine learning. We establish fundamental properties of the Bregman-Wasserstein divergence and propose a novel generalized transport geometry that promotes the Bregman geometry to the space of probability distributions. We provide a probabilistic interpretation involving exponential families and define generalized displacement interpolations compatible with the Bregman geometry. These interpolations are used to derive a generalized Pythagorean inequality, which is of independent interest. Furthermore, we construct a generalized dualistic geometry that lifts the differential geometry of the Bregman divergence to an infinite-dimensional statistical manifold. On the computational side, we demonstrate how Bregman-Wasserstein optimal transport maps can be estimated using neural approaches, establish the well-posedness of Bregman-Wasserstein barycenters, and relate them to Bayesian learning. Finally, we relate the Bregman-Wasserstein divergence to rate distortion theory, and introduce the Bregman-Wasserstein JKO scheme for discretizing Riemannian Wasserstein gradient flows.

IEEE Transactions on Information TheoryVol. 71(11)
University of Toronto (CA), Monash University (AU)
Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 7%
Geometric Analysis and Curvature Flows
3.73
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.