AI Paper Atlas

Research map / Learning theory and algorithms / Optimal transport

Massively scalable Sinkhorn distances via the Nyström method

Jason Altschuler, Francis Bach, Alessandro Rudi, Jonathan Niles-Weed

NeurIPS 2019 · Learning theory and algorithms › Optimal transport · approach: Wasserstein barycenters and GW · 16 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use Nystrom low-rank kernel approximation with Sinkhorn scaling instead of GPU Dual-Sink with annealingNys-Sink · Armadillo vs dragon (n≈3e5)time (s): 35.4 -> 0.4Improved
use Nystrom low-rank kernel approximation with Sinkhorn scaling instead of multiscale annealing Dual-SinkNys-Sink · Armadillo vs xyz-dragon (n≈3.8e6)time (s): 103.6 -> 6.3Improved
use Nys-Sink instead of standard Sinkhorn on random point clouds n≈20000Nys-Sink · Random point cloudstime to reach accuracyImproved
increase ambient dimension from 5 to 100 with fixed rank r=300 (ablation)Nys-Sink · 1-D curves embedded in R^dapproximation error: error smaller than 10^-4No clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy