On the Information Processing of One-Dimensional Wasserstein Distances with Finite Samples

• URL: http://arxiv.org/abs/2511.12881v1
• Date: Mon, 17 Nov 2025 02:16:20 GMT
• Title: On the Information Processing of One-Dimensional Wasserstein Distances with Finite Samples
• Abstract summary: The Wasserstein distance is a summation of sample-wise transport distances in data space.<n>We show that the one-dimensional Wasserstein distance highlights meaningful density differences related to both rate and support.
• Score: 7.385927297587865
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Leveraging the Wasserstein distance -- a summation of sample-wise transport distances in data space -- is advantageous in many applications for measuring support differences between two underlying density functions. However, when supports significantly overlap while densities exhibit substantial pointwise differences, it remains unclear whether and how this transport information can accurately identify these differences, particularly their analytic characterization in finite-sample settings. We address this issue by conducting an analysis of the information processing capabilities of the one-dimensional Wasserstein distance with finite samples. By utilizing the Poisson process and isolating the rate factor, we demonstrate the capability of capturing the pointwise density difference with Wasserstein distances and how this information harmonizes with support differences. The analyzed properties are confirmed using neural spike train decoding and amino acid contact frequency data. The results reveal that the one-dimensional Wasserstein distance highlights meaningful density differences related to both rate and support.

Related papers

• Fast Estimation of Wasserstein Distances via Regression on Sliced Wasserstein Distances [70.94157767200342]
  We propose a fast estimation method based on regressing Wasserstein distance on sliced Wasserstein distances.<n>We show that accurate models can be learned from a small number of distribution pairs.<n>Our method consistently provides a better approximation of Wasserstein distance than the state-of-the-art Wasserstein embedding model, Wasserstein Wormhole.
  arXiv  Detail & Related papers  (2025-09-24T19:30:53Z)
• Physics-Guided Dual Implicit Neural Representations for Source Separation [70.38762322922211]
  We develop a self-supervised machine-learning approach for source separation using a dual implicit neural representation framework.<n>Our method learns directly from the raw data by minimizing a reconstruction-based loss function.<n>Our method offers a versatile framework for addressing source separation problems across diverse domains.
  arXiv  Detail & Related papers  (2025-07-07T17:56:31Z)
• Wasserstein Distances Made Explainable: Insights into Dataset Shifts and Transport Phenomena [3.4991519098475843]
  Wasserstein distances provide a powerful framework for comparing data distributions.<n>We propose a novel solution based on Explainable AI that allows us to efficiently and accurately attribute Wasserstein distances to various data components.
  arXiv  Detail & Related papers  (2025-05-09T15:26:38Z)
• Fused Gromov-Wasserstein Variance Decomposition with Linear Optimal Transport [11.94799054956877]
  We present a decomposition of Fr'echet variance of a set of measures in the 2-Wasserstein space, which allows one to compute the percentage of variance explained by LOT embeddings of those measures. We also present several experiments that explore the relationship between the dimension of the LOT embedding, the percentage of variance explained, and the classification accuracy of machine learning classifiers built on the embedded data.
  arXiv  Detail & Related papers  (2024-11-15T14:10:52Z)
• Private Wasserstein Distance [6.015898117103069]
  Wasserstein distance is a key metric for quantifying data divergence from a distributional perspective.<n>In this study, we explore the inherent triangular properties within the Wasserstein space, leading to a novel solution named TriangleWad.
  arXiv  Detail & Related papers  (2024-04-10T06:58:58Z)
• Mutual Wasserstein Discrepancy Minimization for Sequential Recommendation [82.0801585843835]
  We propose a novel self-supervised learning framework based on Mutual WasserStein discrepancy minimization MStein for the sequential recommendation. We also propose a novel contrastive learning loss based on Wasserstein Discrepancy Measurement.
  arXiv  Detail & Related papers  (2023-01-28T13:38:48Z)
• Ranking the information content of distance measures [61.754016309475745]
  We introduce a statistical test that can assess the relative information retained when using two different distance measures. This in turn allows finding the most informative distance measure out of a pool of candidates.
  arXiv  Detail & Related papers  (2021-04-30T15:57:57Z)
• Depth-based pseudo-metrics between probability distributions [1.1470070927586016]
  We propose two new pseudo-metrics between continuous probability measures based on data depth and its associated central regions. In contrast to the Wasserstein distance, the proposed pseudo-metrics do not suffer from the curse of dimensionality. The regions-based pseudo-metric appears to be robust w.r.t. both outliers and heavy tails.
  arXiv  Detail & Related papers  (2021-03-23T17:33:18Z)
• Two-sample Test using Projected Wasserstein Distance [18.46110328123008]
  We develop a projected Wasserstein distance for the two-sample test, a fundamental problem in statistics and machine learning. A key contribution is to couple optimal projection to find the low dimensional linear mapping to maximize the Wasserstein distance between projected probability distributions.
  arXiv  Detail & Related papers  (2020-10-22T18:08:58Z)
• Interpolation and Learning with Scale Dependent Kernels [91.41836461193488]
  We study the learning properties of nonparametric ridge-less least squares. We consider the common case of estimators defined by scale dependent kernels.
  arXiv  Detail & Related papers  (2020-06-17T16:43:37Z)
• Disentangled Representation Learning with Wasserstein Total Correlation [90.44329632061076]
  We introduce Wasserstein total correlation in both variational autoencoder and Wasserstein autoencoder settings to learn disentangled latent representations. A critic is adversarially trained along with the main objective to estimate the Wasserstein total correlation term. We show that the proposed approach has comparable performances on disentanglement with smaller sacrifices in reconstruction abilities.
  arXiv  Detail & Related papers  (2019-12-30T05:31:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.