English
Related papers

Related papers: Measure transfer via stochastic slicing and matchi…

200 papers

Optimal Transport has received much attention in Machine Learning as it allows to compare probability distributions by exploiting the geometry of the underlying space. However, in its original formulation, solving this problem suffers from…

Machine Learning · Computer Science 2023-11-27 Clément Bonet

Wasserstein distances are widely used in modern data analysis but pose significant computational and statistical challenges in high dimensions. The sliced Wasserstein distance alleviates these challenges by leveraging one-dimensional…

Statistics Theory · Mathematics 2026-05-21 David Rodríguez-Vítores , Eustasio del Barrio , Jean-Michel Loubes

Wasserstein distances are increasingly used in a wide variety of applications in machine learning. Sliced Wasserstein distances form an important subclass which may be estimated efficiently through one-dimensional sorting operations. In…

Machine Learning · Statistics 2019-04-08 Mark Rowland , Jiri Hron , Yunhao Tang , Krzysztof Choromanski , Tamas Sarlos , Adrian Weller

The Sliced Wasserstein (SW) distance has become a popular alternative to the Wasserstein distance for comparing probability measures. Widespread applications include image processing, domain adaptation and generative modelling, where it is…

Machine Learning · Statistics 2025-05-15 Eloi Tanguy , Rémi Flamary , Julie Delon

Optimal transport distances, otherwise known as Wasserstein distances, have recently drawn ample attention in computer vision and machine learning as a powerful discrepancy measure for probability distributions. The recent developments on…

Machine Learning · Computer Science 2015-11-11 Soheil Kolouri , Yang Zou , Gustavo K. Rohde

Score matching is a popular method for estimating unnormalized statistical models. However, it has been so far limited to simple, shallow models or low-dimensional data, due to the difficulty of computing the Hessian of log-density…

Machine Learning · Computer Science 2019-06-28 Yang Song , Sahaj Garg , Jiaxin Shi , Stefano Ermon

We propose to align distributional data from the perspective of Wasserstein means. We raise the problem of regularizing Wasserstein means and propose several terms tailored to tackle different problems. Our formulation is based on the…

Machine Learning · Computer Science 2020-02-24 Liang Mi , Wen Zhang , Yalin Wang

Wasserstein distances define a metric between probability measures on arbitrary metric spaces, including meta-measures (measures over measures). The resulting Wasserstein over Wasserstein (WoW) distance is a powerful, but computationally…

Machine Learning · Computer Science 2026-02-20 Moritz Piening , Robert Beinert

Sliced optimal transport reduces optimal transport on multi-dimensional domains to transport on the line. More precisely, sliced optimal transport is the concatenation of the well-known Radon transform and the cumulative density transform,…

Numerical Analysis · Mathematics 2024-07-03 Michael Quellmalz , Robert Beinert , Gabriele Steidl

In the field of modern high-energy physics research, there is a growing emphasis on utilizing deep learning techniques to optimize event simulation, thereby expanding the statistical sample size for more accurate physical analysis.…

Computational Physics · Physics 2025-06-16 Chu-Cheng Pan , Xiang Dong , Yu-Chang Sun , Ao-Yan Cheng , Ao-Bo Wang , Yu-Xuan Hu , Hao Cai

Optimal transport is a foundational problem in optimization, that allows to compare probability distributions while taking into account geometric aspects. Its optimal objective value, the Wasserstein distance, provides an important loss…

Machine Learning · Computer Science 2020-02-21 Marin Ballu , Quentin Berthet , Francis Bach

We introduce the observable Wasserstein distance, a framework for deriving lower bounds on the Wasserstein distance between probability measures on Polish metric spaces, designed to bypass the computational intractability of exact optimal…

Metric Geometry · Mathematics 2026-05-12 Edivaldo Lopes dos Santos , Leandro Vicente Mauri , Washington Mio , Tom Needham

Optimal Transport (OT) metrics allow for defining discrepancies between two probability measures. Wasserstein distance is for longer the celebrated OT-distance frequently-used in the literature, which seeks probability distributions to be…

Machine Learning · Computer Science 2021-10-14 Mokhtar Z. Alaya , Gilles Gasso , Maxime Berar , Alain Rakotomamonjy

While the existing stochastic control theory is well equipped to handle dynamical systems with stochastic uncertainties, a paradigm shift using distance measure based decision making is required for the effective further exploration of the…

Optimization and Control · Mathematics 2025-12-02 Venkatraman Renganathan , Sei Zhen Khong

We develop a projected Wasserstein distance for the two-sample test, a fundamental problem in statistics and machine learning: given two sets of samples, to determine whether they are from the same distribution. In particular, we aim to…

Machine Learning · Statistics 2024-04-01 Jie Wang , Rui Gao , Yao Xie

Efficient comparison of spherical probability distributions becomes important in fields such as computer vision, geosciences, and medicine. Sliced optimal transport distances, such as spherical and stereographic spherical sliced Wasserstein…

The distance transform (DT) and its many variations are ubiquitous tools for image processing and analysis. In many imaging scenarios, the images of interest are corrupted by noise. This has a strong negative impact on the accuracy of the…

Computer Vision and Pattern Recognition · Computer Science 2020-09-14 Johan Öfverstedt , Joakim Lindblad , Nataša Sladoje

While statistical modeling of distributional data has gained increased attention, the case of multivariate distributions has been somewhat neglected despite its relevance in various applications. This is because the Wasserstein distance,…

Methodology · Statistics 2025-10-21 Han Chen , Yidong Zhou , Hans-Georg Müller

Many variants of Optimal Transport (OT) have been developed to address its heavy computation. Among them, notably, Sliced Wasserstein (SW) is widely used for application domains by projecting the OT problem onto one-dimensional lines, and…

Machine Learning · Computer Science 2025-06-10 Viet-Hoang Tran , Trang Pham , Tho Tran , Minh Khoi Nguyen Nhat , Thanh Chu , Tam Le , Tan M. Nguyen

It has been shown beneficial for many types of data which present an underlying hierarchical structure to be embedded in hyperbolic spaces. Consequently, many tools of machine learning were extended to such spaces, but only few…

Machine Learning · Computer Science 2023-06-27 Clément Bonet , Laetitia Chapel , Lucas Drumetz , Nicolas Courty