arXiv Machine Learning September 2, 2026 By Sebastien Tchitchek, Julien Tierny

Sierpi\'nski--Knopp Wasserstein Distance for Persistence Diagrams and Applications to 2-Wasserstein Approximation

Read the original on arXiv Machine Learning →

arXiv:2609. 01528v1 Announce Type: cross Abstract: This paper introduces the Sierpi\'nski-Knopp (SK) Wasserstein distance, a fast metric between persistence diagrams.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Hugging Face Trending Papers

Sep 1

Sierpiński--Knopp Wasserstein Distance for Persistence Diagrams and Applications to 2-Wasserstein Approximation

This paper introduces the Sierpiński-Knopp (SK) Wasserstein distance, a fast metric between persistence diagrams. The SK-Wasserstein distance, denoted $d_{\mathrm{SK}}$, maps diagram points and their...

rag computer-vision benchmarks

arXiv Machine Learning

Oct 12

Approximating Uniform Random Rotations by Two-Stage Structured Hadamard Rotations in High Dimensions

The paper investigates how well two-stage structured Hadamard rotations approximate uniform random rotations in high-dimensional spaces. It establishes nonasymptotic upper bounds of order √{log d/d} for one-dimensional marginals, while showing a persistent Wasserstein-1 discrepancy for the full vector that does not vanish as dimension grows. These results highlight a separation between marginal and joint approximation quality, though they do not directly translate into algorithmic performance guarantees.

By Tomer Zilca, Gal Mendelson

rag

arXiv Machine Learning

Jul 28

Distance-Matrix Wasserstein Statistics for Scalable Gromov--Wasserstein Learning

arXiv:2605. 14981v2 Announce Type: replace Abstract: Gromov--Wasserstein (GW) distances compare graphs, shapes, and point clouds through internal distances, without requiring a common coordinate system.

By Ao Xu, Tieru Wu

benchmarks safety

arXiv Machine Learning

Jul 23

Total Variation Distance Estimation in Autoregressive Models

arXiv:2607. 19510v1 Announce Type: new Abstract: Modern LLM deployments use a number of implementation choices and inference optimizations (e.

By Eric Price, Kevin Tian, Zhiyang Xun, Yusong Zhu

llms efficiency

arXiv Machine Learning

Sep 3

Exact Limits of Random Projections for Preserving Geometry: Distance Recovery, Nearest-Neighbor Rankings, and Covariance Shape in Gaussian Models

arXiv:2609. 02155v1 Announce Type: new Abstract: The Johnson-Lindenstrauss (JL) lemma guarantees that a random projection of $n$ points to $m=O(\varepsilon^{-2}\log n)$ dimensions preserves pairwise squared distances within relative error $\varepsilon$ with high probability, and this dimension order is asymptotically optimal.

By Piyush Sao

arXiv Machine Learning

Aug 10

Sub-Quadratic Bisimulation Metrics via Approximate Nearest Neighbors: Coverage-Augmented Guarantees and Computable Two-Sided Certificates

arXiv:2608. 06762v1 Announce Type: new Abstract: Bisimulation metrics quantify behavioral similarity in Markov decision processes, but their Wasserstein fixed-point operator updates every state pair and incurs quadratic pairwise work.

By Ibne Farabi Shihab, Joyanta Jyoti Mondal

rag reinforcement-learning benchmarks

One email a morning, machine-written

Related stories

Sierpiński--Knopp Wasserstein Distance for Persistence Diagrams and Applications to 2-Wasserstein Approximation

Approximating Uniform Random Rotations by Two-Stage Structured Hadamard Rotations in High Dimensions

Distance-Matrix Wasserstein Statistics for Scalable Gromov--Wasserstein Learning

Total Variation Distance Estimation in Autoregressive Models

Exact Limits of Random Projections for Preserving Geometry: Distance Recovery, Nearest-Neighbor Rankings, and Covariance Shape in Gaussian Models

Sub-Quadratic Bisimulation Metrics via Approximate Nearest Neighbors: Coverage-Augmented Guarantees and Computable Two-Sided Certificates