Results 31 to 40 of about 4,469 (193)
Supervised Tree-Wasserstein Distance
To measure the similarity of documents, the Wasserstein distance is a powerful tool, but it requires a high computational cost. Recently, for fast computation of the Wasserstein distance, methods for approximating the Wasserstein distance using a tree metric have been proposed.
Yuki Takezawa, Ryoma Sato, Makoto Yamada
openaire +3 more sources
The Quantum Wasserstein Distance of Order 1 [PDF]
We propose a generalization of the Wasserstein distance of order 1 to the quantum states of $n$ qudits. The proposal recovers the Hamming distance for the vectors of the canonical basis, and more generally the classical Wasserstein distance for quantum states diagonal in the canonical basis.
Giacomo De Palma +3 more
openaire +3 more sources
Irregularity of Distribution in Wasserstein Distance [PDF]
16 ...
openaire +3 more sources
Hierarchical Sliced Wasserstein Distance
Accepted to ICLR 2023, 29 pages, 8 figures, 3 tables,
Khai Nguyen +5 more
openaire +3 more sources
Quasi Manhattan Wasserstein Distance
The Quasi Manhattan Wasserstein Distance (QMWD) is a metric designed to quantify the dissimilarity between two matrices by combining elements of the Wasserstein Distance with specific transformations. It offers improved time and space complexity compared to the Manhattan Wasserstein Distance (MWD) while maintaining accuracy.
openaire +2 more sources
Augmented Sliced Wasserstein Distances
While theoretically appealing, the application of the Wasserstein distance to large-scale machine learning problems has been hampered by its prohibitive computational cost. The sliced Wasserstein distance and its variants improve the computational efficiency through the random projection, yet they suffer from low accuracy if the number of projections ...
Xiongjie Chen +2 more
openaire +3 more sources
Ensemble Riemannian data assimilation over the Wasserstein space [PDF]
In this paper, we present an ensemble data assimilation paradigm over a Riemannian manifold equipped with the Wasserstein metric. Unlike the Euclidean distance used in classic data assimilation methodologies, the Wasserstein metric can capture the ...
S. K. Tamang +6 more
doaj +1 more source
Donsker’s theorem in Wasserstein-1 distance [PDF]
We compute the Wassertein-1 (or Kolmogorov-Rubinstein) distance between a random walk in $R^d$ and the Brownian motion. The proof is based on a new estimate of the Lipschitz modulus of the solution of the Stein's equation. As an application, we can evaluate the rate of convergence towards the local time at 0 of the Brownian motion.
Coutin, Laure, Decreusefond, Laurent
openaire +4 more sources
Target detection based on generalized Bures–Wasserstein distance
Radar target detection with fewer echo pulses in non-Gaussian clutter background is a challenging problem. In this instance, the conventional detectors using coherent accumulation are not very satisfactory.
Zhizhong Huang, Lin Zheng
doaj +1 more source
Open-Set Signal Recognition Based on Transformer and Wasserstein Distance
Open-set signal recognition provides a new approach for verifying the robustness of models by introducing novel unknown signal classes into the model testing and breaking the conventional closed-set assumption, which has become very popular in real-world
Wei Zhang +4 more
doaj +1 more source

