English
Related papers

Related papers: Physics-driven Comparative Analysis of Various Sta…

200 papers

Wasserstein distances provide a metric on a space of probability measures. We consider the space $\Omega$ of all probability measures on the finite set $\chi = \{1, \dots ,n\}$ where $n$ is a positive integer. 1-Wasserstein distance,…

Probability · Mathematics 2021-04-21 Andrew Frohmader , Hans Volkmer

A common way to discretize a probability measure is to use an empirical measure as a discrete approximation. But how far from being optimal is this approximation in the p-Wasserstein distance? In this paper, we study this question in two…

Probability · Mathematics 2025-08-05 March T. Boedihardjo

We use Wasserstein distances to characterize and study probabilistic frames. Adapting results from Olkin and Pukelsheim, from Gelbrich and from Cuesta-Albertos, Matran-Bea and Tuero-Diaz to frame operators, we show that the sets of…

Probability · Mathematics 2025-06-18 Dongwei Chen , Martin Schmoll

We introduce a novel, geometry-aware distance metric for the family of von Mises-Fisher (vMF) distributions, which are fundamental models for directional data on the unit hypersphere. Although the vMF distribution is widely employed in a…

Machine Learning · Statistics 2025-04-22 Kisung You , Dennis Shung , Mauro Giuffrè

We consider problems of estimation of structured covariance matrices, and in particular of matrices with a Toeplitz structure. We follow a geometric viewpoint that is based on some suitable notion of distance. To this end, we overview and…

Optimization and Control · Mathematics 2011-10-18 Lipeng Ning , Xianhua Jiang , Tryphon Georgiou

Most metrics between finite point measures currently used in the literature have the flaw that they do not treat differing total masses in an adequate manner for applications. This paper introduces a new metric $\bar{d}_1$ that combines…

Probability · Mathematics 2007-08-22 Dominic Schuhmacher , Aihua Xia

This article proposes a method to consistently estimate functionals $\frac1p\sum_{i=1}^pf(\lambda_i(C_1C_2))$ of the eigenvalues of the product of two covariance matrices $C_1,C_2\in\mathbb{R}^{p\times p}$ based on the empirical estimates…

Machine Learning · Statistics 2019-03-11 Malik Tiomoko , Romain Couillet

In this paper we study Probability Measures (PM) from a functional point of view: we show that PMs can be considered as functionals (generalized functions) that belong to some functional space endowed with an inner product. This approach…

Methodology · Statistics 2015-04-08 Alberto Muñoz , Gabriel Martos , Javier González

The Fisher-Rao distance between two probability distributions of a statistical model is defined as the Riemannian geodesic distance induced by the Fisher information metric. In order to calculate the Fisher-Rao distance in closed-form, we…

Information Theory · Computer Science 2025-01-08 Frank Nielsen

We provide an implementation to compute the flat metric in any dimension. The flat metric, also called dual bounded Lipschitz distance, generalizes the well-known Wasserstein distance $W_1$ to the case that the distributions are of unequal…

Machine Learning · Computer Science 2025-06-17 Henri Schmidt , Christian Düll

There is a sequence of random numbers x1,x2, ..., xn and so on. Numbers are independent of each other, but all numbers are from the same continuous distribution. If x1 < x2 > x3, then x2 is a local maximum. Here, we show that the…

Statistics Theory · Mathematics 2007-06-13 Argyn Kuketayev

Many information retrieval algorithms rely on the notion of a good distance that allows to efficiently compare objects of different nature. Recently, a new promising metric called Word Mover's Distance was proposed to measure the divergence…

Computation and Language · Computer Science 2018-05-14 Georgios Balikas , Charlotte Laclau , Ievgen Redko , Massih-Reza Amini

We identify shortcomings in two popular measures of localization of functions: the $L^p-L^q$ participation ratio and the mass concentration comparison. We then introduce a novel localization measure for functions on bounded subsets of…

Analysis of PDEs · Mathematics 2025-04-17 Mirza Karamehmedović , Faouzi Triki

In frequentist inference, minimizing the Hellinger distance between a kernel density estimate and a parametric family produces estimators that are both robust to outliers and statistically efficienty when the parametric model is correct.…

Statistics Theory · Mathematics 2018-12-12 Yuefeng Wu , Giles Hooker

The $2$-Wasserstein distance is sensitive to minor geometric differences between distributions, making it a very powerful dissimilarity metric. However, due to this sensitivity, a small outlier mass can also cause a significant increase in…

Machine Learning · Computer Science 2024-06-04 Sharath Raghvendra , Pouyan Shirzadian , Kaiyi Zhang

Images obtained from coherent illumination processes are contaminated with speckle. A prominent example of such imagery systems is the polarimetric synthetic aperture radar (PolSAR). For such remote sensing tool the speckle interference…

Information Theory · Computer Science 2018-09-18 Abraão D. C. Nascimento , Alejandro C. Frery , Renato J. Cintra

Goodness-of-fit tests based on the empirical Wasserstein distance are proposed for simple and composite null hypotheses involving general multivariate distributions. For group families, the procedure is to be implemented after preliminary…

Methodology · Statistics 2021-01-28 Marc Hallin , Gilles Mordant , Johan Segers

We propose a methodology for intercomparing climate models and evaluating their performance against benchmarks based on the use of the Wasserstein distance (WD). This distance provides a rigorous way to measure quantitatively the difference…

Atmospheric and Oceanic Physics · Physics 2020-11-16 Gabriele Vissio , Valerio Lembo , Valerio Lucarini , Michael Ghil

This article investigates the probabilistic relationship between quantum classification of Boolean functions and their Hamming distance. By integrating concepts from quantum computing, information theory, and combinatorics, we explore how…

Sinkhorn divergence is a measure of dissimilarity between two probability measures. It is obtained through adding an entropic regularization term to Kantorovich's optimal transport problem and can hence be viewed as an entropically…

Numerical Analysis · Mathematics 2020-05-01 Mohammad Motamed