English
Related papers

Related papers: Linearized Wasserstein Barycenters: Synthesis, Ana…

200 papers

We study the fixed-support Wasserstein barycenter problem (FS-WBP), which consists in computing the Wasserstein barycenter of $m$ discrete probability measures supported on a finite metric space of size $n$. We show first that the…

Computational Complexity · Computer Science 2022-06-07 Tianyi Lin , Nhat Ho , Xi Chen , Marco Cuturi , Michael I. Jordan

The Lattice Boltzmann Method (LBM) has emerged as a powerful tool in computational fluid dynamics and material science. However, standard LBM formulation imposes some limitations on the applications of the method, particularly compressible…

Soft Condensed Matter · Physics 2025-03-14 Navid Afrasiabian , Colin Denniston

A common feature of methods for analyzing samples of probability density functions is that they respect the geometry inherent to the space of densities. Once a metric is specified for this space, the Fr\'echet mean is typically used to…

Methodology · Statistics 2018-12-20 Alexander Petersen , Hans-Georg Müller

In this thesis, we consider the Wasserstein barycenter problem of discrete probability measures from computational and statistical sides. The statistical focus is estimating the sample size of measures necessary to calculate an…

Optimization and Control · Mathematics 2021-10-26 Darina Dvinskikh

The birth of the lattice Boltzmann method (LBM) fulfils a dream that simple arithmetic calculations can simulate complex fluid flows without solving complicated partial differential flow equations. Its power and potential of resolving more…

Computational Engineering, Finance, and Science · Computer Science 2019-01-10 Jian Guo Zhou

We establish a strong law of large numbers and a central limit theorem in the Bures-Wasserstein space of covariance operators -- or equivalently centred Gaussian measures -- over a general separable Hilbert space. Specifically, we show that…

Probability · Mathematics 2024-11-05 Leonardo V. Santoro , Victor M. Panaretos

We investigate barycenters of Gaussian process laws in adapted Wasserstein space. The adapted Wasserstein distance refines classical optimal transport by enforcing compatibility of transport plans with the temporal flow of information, and…

Probability · Mathematics 2026-04-27 Francesco Mattesini , Johannes Wiesel

Barycentric averaging is a principled way of summarizing populations of measures. Existing algorithms for estimating barycenters typically parametrize them as weighted sums of Diracs and optimize their weights and/or locations. However,…

Machine Learning · Statistics 2021-02-16 Samuel Cohen , Michael Arbel , Marc Peter Deisenroth

Computing the unregularized Wasserstein barycenter for measure-valued data is a challenging optimization task. Recent algorithms have been tailored to either discrete measures as point clouds or continuous measures discretized on regular…

Optimization and Control · Mathematics 2026-05-13 Peng Xu , Changbo Zhu , Xiaohui Chen

The pseudopotential lattice Boltzmann method (LBM) is a prominent approach for simulating multiphase flows, valued for its physical intuitiveness and computational tractability. However, existing immiscible pseudopotential methods for…

Fluid Dynamics · Physics 2026-03-02 Yizhong Chen , Zhibin Wang

We present a systematic account of recent developments of the relativistic Lattice Boltzmann method (RLBM) for dissipative hydrodynamics. We describe in full detail a unified, compact and dimension-independent procedure to design…

High Energy Physics - Lattice · Physics 2020-05-29 A. Gabbana , D. Simeoni , S. Succi , R. Tripiccione

In this paper, analytic relations between the macroscopic variables and the mesoscopic variables are derived for lattice Boltzmann methods (LBM). The analytic relations are achieved by two different methods for the exchange from velocity…

Fluid Dynamics · Physics 2015-03-19 Hui Xu , Huibao Luan , Yaling He , Wenquan Tao

We consider probabilistic models for sequential observations which exhibit gradual transitions among a finite number of states. We are particularly motivated by applications such as human activity analysis where observed accelerometer time…

Machine Learning · Computer Science 2023-09-22 Kevin C. Cheng , Shuchin Aeron , Michael C. Hughes , Eric L. Miller

Multi-marginal optimal transport enables one to compare multiple probability measures, which increasingly finds application in multi-task learning problems. One practical limitation of multi-marginal transport is computational scalability…

The discrete distribution is often used to describe complex instances in machine learning, such as images, sequences, and documents. Traditionally, clustering of discrete distributions (D2C) has been approached using Wasserstein barycenter…

Machine Learning · Computer Science 2024-08-19 Zixiao Wang , Dong Qiao , Jicong Fan

Multi-marginal optimal transport (MOT) is a generalization of optimal transport to multiple marginals. Optimal transport has evolved into an important tool in many machine learning applications, and its multi-marginal extension opens up for…

Machine Learning · Computer Science 2021-12-07 Jiaojiao Fan , Isabel Haasler , Johan Karlsson , Yongxin Chen

We show that the problem of finding the barycenter in the Hellinger-Kantorovich setting admits a least-cost soft multi-marginal formulation, provided that a one-sided hard marginal constraint is introduced. The constrained approach is then…

Optimization and Control · Mathematics 2025-01-22 Maciej Buze

The lattice-Boltzmann method (LBM) and its variants have emerged as promising, computationally efficient and increasingly popular numerical methods for modelling complex fluid flow. However, it is acknowledged that the method can…

Statistical Mechanics · Physics 2007-05-23 R. A. Brownlee , A. N. Gorban , J. Levesley

In this work clustering schemes for uncertain and structured data are considered relying on the notion of Wasserstein barycenters, accompanied by appropriate clustering indices based on the intrinsic geometry of the Wasserstein space where…

This paper presents an efficient algorithm for the progressive approximation of Wasserstein barycenters of persistence diagrams, with applications to the visual analysis of ensemble data. Given a set of scalar fields, our approach enables…

Graphics · Computer Science 2019-10-10 Jules Vidal , Joseph Budin , Julien Tierny
‹ Prev 1 3 4 5 6 7 10 Next ›