paper-with-me

Papers

Sliced Wasserstein Estimation with Control Variates

2023-04-30 · Khai Nguyen, Nhat Ho

The sliced Wasserstein (SW) distances between two probability measures are defined as the expectation of the Wasserstein distance between two one-dimensional projections of the two measures. The randomness comes from a projecting direction that is used to project the two input measures to one dimension. Due to the intractability of the expectation, Monte Carlo integration is performed to estimate the value of the SW distance. Despite having various variants, there has been no prior work that improves the Monte Carlo estimation scheme for the SW distance in terms of controlling its variance. To bridge the literature on variance reduction and the literature on the SW distance, we propose computationally efficient control variates to reduce the variance of the empirical estimation of the SW distance. The key idea is to first find Gaussian approximations of projected one-dimensional measures, then we utilize the closed-form of the Wasserstein-2 distance between two Gaussian distributions to design the control variates. In particular, we propose using a lower bound and an upper bound of the Wasserstein-2 distance between two fitted Gaussians as two computationally efficient control variates. We empirically show that the proposed control variate estimators can help to reduce the variance considerably when comparing measures over images and point-clouds. Finally, we demonstrate the favorable performance of the proposed control variate estimators in gradient flows to interpolate between two point-clouds and in deep generative modeling on standard image datasets, such as CIFAR10 and CelebA.

📄 PDF Abstract BibTeX arXiv:2305.00402

Code (1)

khainb/cv-sw 공식 구현 pytorch

Similar Papers 제목 키워드 기반

Sliced-Wasserstein Estimation with Spherical Harmonics as Control Variates

2024-02-02 · Rémi Leluc, Aymeric Dieuleveut, François Portier, Johan Segers 외

The Sliced-Wasserstein (SW) distance between probability measures is defined as the average of the Wasserstein distances resulting for the associated one-dimensional projections. As a consequence, the SW distance can be …

Statistical, Robustness, and Computational Guarantees for Sliced Wasserstein Distances

2022-10-17 · Sloan Nietert, Ritwik Sadhu, Ziv Goldfeld, Kengo Kato

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 th…

Numerical Integration

Bounds in Wasserstein distance for locally stationary processes

2024-12-04 · Jan Nino G. Tinio, Mokhtar Z. Alaya, Salim Bouzebda

Locally stationary processes (LSPs) provide a robust framework for modeling time-varying phenomena, allowing for smooth variations in statistical properties such as mean and variance over time. In this paper, we address …

Orthogonal Estimation of Wasserstein Distances

2019-03-09 · Mark Rowland, Jiri Hron, Yunhao Tang, Krzysztof Choromanski 외

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 sortin…

BIG-bench Machine Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Highly Data Parallelizable Estimation of the Sliced-Wasserstein Distance Using Cumulative Distribution Functions

2026-06-29 · Christophe Vauthier, Quentin Mérigot, Anna Korba arxiv

The Sliced Wasserstein (SW) distance has emerged as a computationally attractive alternative to the Wasserstein distance by leveraging one-dimensional optimal transport along random projections. Standard estimators of th…

Federated Learning