Zobrazeno 1 - 10
of 983
pro vyhledávání: '"Wasserstein barycenter"'
We study the Wasserstein barycenter problem in the setting of non-compact, non-smooth extended metric measure spaces. We introduce a couple of new concepts and obtain the existence, uniqueness, absolute continuity of the Wasserstein barycenter, and p
Externí odkaz:
http://arxiv.org/abs/2412.01190
The fairness of clustering algorithms has gained widespread attention across various areas, including machine learning, In this paper, we study fair $k$-means clustering in Euclidean space. Given a dataset comprising several groups, the fairness cons
Externí odkaz:
http://arxiv.org/abs/2411.01115
The sliced Wasserstein barycenter (SWB) is a widely acknowledged method for efficiently generalizing the averaging operation within probability measure spaces. However, achieving marginal fairness SWB, ensuring approximately equal distances from the
Externí odkaz:
http://arxiv.org/abs/2405.07482
Autor:
Chen, Keyu, Zhang, Yunxin
The optimal transport and Wasserstein barycenter of Gaussian distributions have been solved. In literature, the closed form formulas of the Monge map, the Wasserstein distance and the Wasserstein barycenter have been given. Moreover, when Gaussian di
Externí odkaz:
http://arxiv.org/abs/2404.08383
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Yang, Qingyuan, Ding, Hu
Wasserstein Barycenter (WB) is one of the most fundamental optimization problems in optimal transportation. Given a set of distributions, the goal of WB is to find a new distribution that minimizes the average Wasserstein distance to them. The proble
Externí odkaz:
http://arxiv.org/abs/2404.13401
The information rate-distortion-perception (RDP) function characterizes the three-way trade-off between description rate, average distortion, and perceptual quality measured by discrepancy between probability distributions and has been applied to eme
Externí odkaz:
http://arxiv.org/abs/2404.04681
The Wasserstein barycenter problem is to compute the average of $m$ given probability measures, which has been widely studied in many different areas; however, real-world data sets are often noisy and huge, which impedes its applications in practice.
Externí odkaz:
http://arxiv.org/abs/2312.15762
The \emph{simplified} Wasserstein barycenter problem, also known as the cheapest hub problem, consists in selecting one point from each of $k$ given sets, each set consisting of $n$ points, with the aim of minimizing the sum of distances to the baryc
Externí odkaz:
http://arxiv.org/abs/2311.05045
The Wasserstein barycenter (WB) is an important tool for summarizing sets of probability measures. It finds applications in applied probability, clustering, image processing, etc. When the measures' supports are finite, computing a (balanced) WB can
Externí odkaz:
http://arxiv.org/abs/2309.05315