← Back to all news
Hugging Face Trending Papers September 1, 2026

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

Read the original on Hugging Face Trending Papers →

The Flow has not summarised this story yet — read it at Hugging Face Trending Papers.

  • rag
  • computer-vision
  • benchmarks

One email a morning, machine-written

One email a day, machine-written, one click to leave. We never share your address.

Related stories

arXiv Machine Learning
4d ago

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

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

By Sebastien Tchitchek, Julien Tierny
ragcomputer-visionbenchmarks
More like this →
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
benchmarkssafety
More like this →
arXiv Machine Learning
Jul 30

Persistence Spheres: a Bi-continuous Linear Representation of Measures for Partial Optimal Transport

arXiv:2603. 15384v2 Announce Type: replace-cross Abstract: We improve and extend persistence spheres, introduced in~\cite{pegoraro2025persistence}.

By Matteo Pegoraro
rag
More like this →
arXiv Machine Learning
3d ago

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...

By Piyush Sao
More like this →
arXiv Statistics ML
Aug 25

Spectral partitioning for $k$-block averaging kernels of finite Markov chains

arXiv:2608.21466v1 Announce Type: new Abstract: We develop spectral algorithms for selecting state-space partitions that define averaging kernels for finite, ergodic and reversible Markov chains. For...

By Michael C. H. Choi, Youjia Wang
rag
More like this →
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
llmsefficiency
More like this →
About Pricing API Newsletter Sources Privacy Terms Refunds Accessibility Provider info Contact RSS

The Flow links to publishers and never republishes their articles. Summaries are machine-generated.

v1.1.0 · 5f852ea