AI Paper Atlas

Research map / Learning theory and algorithms / Optimal transport

Fast Unbalanced Optimal Transport on a Tree

Ryoma Sato, Makoto Yamada, Hisashi Kashima

NeurIPS 2020 · Learning theory and algorithms › Optimal transport · approach: Sinkhorn and entropic OT algorithms

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
Approximate Euclidean GKR with quadtree GKRGKR · Chicago CrimeSpearman's ρ: larger than 0.9 for most λImproved
Approximate Euclidean GKR with quadtree GKRGKR · Chicago Crimerelative error: less than 0.1 for most casesImproved
Use GKR with raw event measures rather than normalized standard OTNewYork taxi dataset distance visualization · NewYork taxi datasetanomaly-day separationImproved
Use tree sliced Wasserstein with normalized measures rather than GKRNewYork taxi dataset distance visualization · NewYork taxi datasetanomaly-day separationHurt

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