English
Related papers

Related papers: Outlier-Robust Optimal Transport: Duality, Structu…

200 papers

This work investigates several aspects related to quantitative stability in optimal transport, as well as uniqueness of the dual transport problem. Our main contributions are as follows. Chapter 1: Observations regarding the quantitative…

Functional Analysis · Mathematics 2025-10-22 William Ford

The Wasserstein distance $\mathcal{W}_p$ is an important instance of an optimal transport cost. Its numerous mathematical properties as well as applications to various fields such as mathematical finance and statistics have been well…

Probability · Mathematics 2025-07-09 Jose Blanchet , Martin Larsson , Jonghwa Park , Johannes Wiesel

The Wasserstein distance is an attractive tool for data analysis but statistical inference is hindered by the lack of distributional limits. To overcome this obstacle, for probability measures supported on finitely many points, we derive…

Methodology · Statistics 2017-04-27 Max Sommerfeld , Axel Munk

We study distributionally robust optimization (DRO) problems with uncertainty sets consisting of high-dimensional random vectors that are close in the multivariate Wasserstein distance to a reference random vector. We give conditions when…

Optimization and Control · Mathematics 2026-01-30 Brandon Tam , Silvana M. Pesenti

In this paper we propose tight upper and lower bounds for the Wasserstein distance between any two {{univariate continuous distributions}} with probability densities $p_1$ and $p_2$ having nested supports. These explicit bounds are…

Probability · Mathematics 2015-10-21 Christophe Ley , Gesine Reinert , Yvik Swan

Controlling the $\mathcal W_\infty$ Wasserstein distance by the $\mathcal W_p$ Wasserstein distance is interesting both for theorical and numerical applications. A first paper on this problem was written several years ago [3]. Some year…

Optimization and Control · Mathematics 2026-01-22 Luigi De Pascale , Igor Pinheiro

We study the problem of efficiently detecting Out-of-Distribution (OOD) samples at test time in supervised and unsupervised learning contexts. While ML models are typically trained under the assumption that training and test data stem from…

Machine Learning · Computer Science 2024-05-13 Alberto Caron , Chris Hicks , Vasilios Mavroudis

In this note, we propose an extension of the Wasserstein 1-metric ($W_1$) for matrix probability densities, matrix-valued density measures, and an unbalanced interpretation of mass transport. The key is using duality theory, in particular,…

Functional Analysis · Mathematics 2017-03-07 Yongxin Chen , Tryphon T. Georgiou , Lipeng Ning , Allen Tannenbaum

In inverse problems, many conditional generative models approximate the posterior measure by minimizing a distance between the joint measure and its learned approximation. While this approach also controls the distance between the posterior…

Machine Learning · Computer Science 2025-08-28 Jannis Chemseddine , Paul Hagemann , Gabriele Steidl , Christian Wald

Sliced Wasserstein distances preserve properties of classic Wasserstein distances while being more scalable for computation and estimation in high dimensions. The goal of this work is to quantify this scalability from three key aspects: (i)…

Machine Learning · Statistics 2022-10-18 Sloan Nietert , Ritwik Sadhu , Ziv Goldfeld , Kengo Kato

We present a distributionally robust formulation of a stochastic optimization problem for non-i.i.d vector autoregressive data. We use the Wasserstein distance to define robustness in the space of distributions and we show, using duality…

Optimization and Control · Mathematics 2019-09-10 Xialiang Dou , Mihai Anitescu

Uniformity testing and the more general identity testing are well studied problems in distributional property testing. Most previous work focuses on testing under $L_1$-distance. However, when the support is very large or even continuous,…

Machine Learning · Computer Science 2017-10-31 Shichuan Deng , Wenzheng Li , Xuan Wu

Off-policy evaluation and learning are concerned with assessing a given policy and learning an optimal policy from offline data without direct interaction with the environment. Often, the environment in which the data are collected differs…

Machine Learning · Computer Science 2024-01-18 Yi Shen , Pan Xu , Michael M. Zavlanos

Squared Wasserstein distance is a frequently used tool to measure discrepancy between probability distributions. This distance is typically computed between empirical measures of size $n$ from two underlying random samples. Unfortunately,…

Machine Learning · Statistics 2026-05-20 Peter Matthew Jacobs , Jeff M. Phillips

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

We study the problem of minimizing the Wasserstein distance between a probability distribution and an algebraic variety. We consider the setting of finite state spaces and describe the solution depending on the choice of the ground metric…

Optimization and Control · Mathematics 2020-01-15 T. Ö. Çelik , A. Jamneshan , G. Montúfar , B. Sturmfels , L. Venturello

We consider machine learning, particularly regression, using locally-differentially private datasets. The Wasserstein distance is used to define an ambiguity set centered at the empirical distribution of the dataset corrupted by local…

Machine Learning · Computer Science 2020-06-25 Farhad Farokhi

We revisit Markowitz's mean-variance portfolio selection model by considering a distributionally robust version, where the region of distributional uncertainty is around the empirical measure and the discrepancy between probability measures…

Methodology · Statistics 2018-02-15 Jose Blanchet , Lin Chen , Xun Yu Zhou

We obtain explicit $p$-Wasserstein distance error bounds between the distribution of the multi-parameter MLE and the multivariate normal distribution. Our general bounds are given for possibly high-dimensional, independent and identically…

Statistics Theory · Mathematics 2021-12-28 Andreas Anastasiou , Robert E. Gaunt

Semi-discrete optimal transport problems, which evaluate the Wasserstein distance between a discrete and a generic (possibly non-discrete) probability measure, are believed to be computationally hard. Even though such problems are…

Machine Learning · Computer Science 2022-05-02 Bahar Taskesen , Soroosh Shafieezadeh-Abadeh , Daniel Kuhn
‹ Prev 1 4 5 6 7 8 10 Next ›