English
Related papers

Related papers: Two-sample Test with Kernel Projected Wasserstein …

200 papers

It was recently shown that under smoothness conditions, the squared Wasserstein distance between two distributions could be efficiently computed with appealing statistical error upper bounds. However, rather than the distance itself, the…

Machine Learning · Statistics 2021-12-30 Boris Muzellec , Adrien Vacher , Francis Bach , François-Xavier Vialard , Alessandro Rudi

Considering two random variables with different laws to which we only have access through finite size iid samples, we address how to reweight the first sample so that its empirical distribution converges towards the true law of the second…

Statistics Theory · Mathematics 2022-06-08 Julien Reygner , Adrien Touboul

In this paper, we establish sharp upper and lower bounds on the convergence rate of the empirical measures of point processes under the Wasserstein distance. To this end, we first introduce a new metric on the space of counting measures…

Statistics Theory · Mathematics 2026-04-28 Dongzhou Huang , Tianyi Jiang , Haonan Wang

In this paper, we study the angle testing problem in the context of similarity search in high-dimensional Euclidean spaces and propose two projection-based probabilistic kernel functions, one designed for angle comparison and the other for…

Machine Learning · Computer Science 2026-03-03 Kejing Lu , Chuan Xiao , Yoshiharu Ishikawa

For statistical models on circles, we investigate performance of estimators defined as the projections of the empirical distribution with respect to the Wasserstein distance. We develop algorithms for computing the Wasserstein projection…

Statistics Theory · Mathematics 2025-10-22 Naoki Otani , Takeru Matsuda

In this paper, for $\mu$ and $\nu$ two probability measures on $\mathbb{R}^d$ with finite moments of order $\rho\ge 1$, we define the respective projections for the $W_\rho$-Wasserstein distance of $\mu$ and $\nu$ on the sets of probability…

Probability · Mathematics 2019-02-11 Aurélien Alfonsi , Jacopo Corbetta , Benjamin Jourdain

Conditional distribution is a fundamental quantity for describing the relationship between a response and a predictor. We propose a Wasserstein generative approach to learning a conditional distribution. The proposed approach uses a…

Machine Learning · Computer Science 2021-12-21 Shiao Liu , Xingyu Zhou , Yuling Jiao , Jian Huang

We study the comparison problem of distribution equality between two random samples under a right censoring scheme. To address this problem, we design a series of tests based on energy distance and kernel mean embeddings. We calibrate our…

Methodology · Statistics 2019-12-10 Marcos Matabuena , Oscar Hernan Madrid Padilla

The problem of learning functions over spaces of probabilities - or distribution regression - is gaining significant interest in the machine learning community. A key challenge behind this problem is to identify a suitable representation…

Machine Learning · Statistics 2022-06-20 Dimitri Meunier , Massimiliano Pontil , Carlo Ciliberto

We propose a framework to construct practical kernel-based two-sample tests from the family of $f$-divergences. The test statistic is computed from the witness function of a regularized variational representation of the divergence, which we…

Machine Learning · Statistics 2026-01-28 Mónica Ribero , Antonin Schrab , Arthur Gretton

We propose conditional flows of the maximum mean discrepancy (MMD) with the negative distance kernel for posterior sampling and conditional generative modeling. This MMD, which is also known as energy distance, has several advantageous…

We propose a scalable robust learning algorithm combining kernel smoothing and robust optimization. Our method is motivated by the convex analysis perspective of distributionally robust optimization based on probability metrics, such as the…

Machine Learning · Computer Science 2022-02-22 Jia-Jie Zhu , Christina Kouridi , Yassine Nemmour , Bernhard Schölkopf

We study nonparametric density estimation problems where error is measured in the Wasserstein distance, a metric on probability distributions popular in many areas of statistics and machine learning. We give the first minimax-optimal rates…

Statistics Theory · Mathematics 2020-04-30 Jonathan Niles-Weed , Quentin Berthet

The adapted Wasserstein distance controls the calibration errors of optimal values in various stochastic optimization problems, pricing and hedging problems, optimal stopping problems, etc. However, statistical aspects of the adapted…

Probability · Mathematics 2025-09-16 Songyan Hou

Consider a set of points sampled independently near a smooth compact submanifold of Euclidean space. We provide mathematically rigorous bounds on the number of sample points required to estimate both the dimension and the tangent spaces of…

Statistics Theory · Mathematics 2023-09-26 Uzu Lim , Harald Oberhauser , Vidit Nanda

Generalized sliced Wasserstein distance is a variant of sliced Wasserstein distance that exploits the power of non-linear projection through a given defining function to better capture the complex structures of the probability…

Machine Learning · Statistics 2022-10-20 Dung Le , Huy Nguyen , Khai Nguyen , Trang 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…

Machine Learning · Statistics 2024-02-20 Khai Nguyen , Nhat Ho

We provide a unifying framework linking two classes of statistics used in two-sample and independence testing: on the one hand, the energy distances and distance covariances from the statistics literature; on the other, distances between…

Machine Learning · Computer Science 2015-03-20 Dino Sejdinovic , Arthur Gretton , Bharath Sriperumbudur , Kenji Fukumizu

Comparing spherical probability distributions is of great interest in various fields, including geology, medical domains, computer vision, and deep representation learning. The utility of optimal transport-based distances, such as the…

Machine Learning · Computer Science 2024-06-11 Huy Tran , Yikun Bai , Abihith Kothapalli , Ashkan Shahbazi , Xinran Liu , Rocio Diaz Martin , Soheil Kolouri

Existing approaches to depth or disparity estimation output a distribution over a set of pre-defined discrete values. This leads to inaccurate results when the true depth or disparity does not match any of these values. The fact that this…

Computer Vision and Pattern Recognition · Computer Science 2021-03-30 Divyansh Garg , Yan Wang , Bharath Hariharan , Mark Campbell , Kilian Q. Weinberger , Wei-Lun Chao
‹ Prev 1 4 5 6 7 8 10 Next ›