paper-with-me

홈 › Papers

Wasserstein gradient flow for optimal probability measure decomposition

2024-06-03 · Jiangze Han, Christopher Thomas Ryan, Xin T. Tong

We examine the infinite-dimensional optimization problem of finding a decomposition of a probability measure into K probability sub-measures to minimize specific loss functions inspired by applications in clustering and user grouping. We analytically explore the structures of the support of optimal sub-measures and introduce algorithms based on Wasserstein gradient flow, demonstrating their convergence. Numerical results illustrate the implementability of our algorithms and provide further insights.

📄 PDF Abstract BibTeX arXiv:2406.00914

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Similar Papers 제목 키워드 기반

$L^2$ over Wasserstein: Statistical Analysis for Optimal Transport

2026-05-20 · Riccardo Passeggeri, Rohan M. Shenoy, Pengcheng Ye arxiv

Optimal transport provides an inherently geometric and highly structured framework for studying spaces of probability measures, supplying a rich theoretical toolkit for contemporary statistics, machine learning, and gene…

Hessian-guided Perturbed Wasserstein Gradient Flows for Escaping Saddle Points

2025-09-21 · Naoya Yamamoto, Juno Kim, Taiji Suzuki arxiv

Wasserstein gradient flow (WGF) is a common method to perform optimization over the space of probability measures. While WGF is guaranteed to converge to a first-order stationary point, for nonconvex functionals the conv…

Flowing Datasets with Wasserstein over Wasserstein Gradient Flows

2025-06-09 · Clément Bonet, Christophe Vauthier, Anna Korba

Many applications in machine learning involve data represented as probability distributions. The emergence of such data requires radically novel techniques to design tractable gradient flows on probability distributions …

Dataset DistillationDomain AdaptationTransfer Learning

The Wasserstein Proximal Gradient Algorithm

2020-02-07 · NeurIPS 2020 12 · Adil Salim, Anna Korba, Giulia Luise

Wasserstein gradient flows are continuous time dynamics that define curves of steepest descent to minimize an objective function over the space of probability measures (i.e., the Wasserstein space). This objective is typ…

Continuous-time Riemannian SGD and SVRG Flows on Wasserstein Probabilistic Space

2024-01-24 · Mingyang Yi, Bohan Wang

Recently, optimization on the Riemannian manifold has provided new insights to the optimization community. In this regard, the manifold taken as the probability measure metric space equipped with the second-order Wassers…

Stochastic Optimization