An Õ(n^5/4) Time ε-Approximation Algorithm for RMS Matching in a Plane

07/15/2020
by   Nathaniel Lahn, et al.
0

The 2-Wasserstein distance (or RMS distance) is a useful measure of similarity between probability distributions that has exciting applications in machine learning. For discrete distributions, the problem of computing this distance can be expressed in terms of finding a minimum-cost perfect matching on a complete bipartite graph given by two multisets of points A,B ⊂ℝ^2, with |A|=|B|=n, where the ground distance between any two points is the squared Euclidean distance between them. Although there is a near-linear time relative ε-approximation algorithm for the case where the ground distance is Euclidean (Sharathkumar and Agarwal, JACM 2020), all existing relative ε-approximation algorithms for the RMS distance take Ω(n^3/2) time. This is primarily because, unlike Euclidean distance, squared Euclidean distance is not a metric. In this paper, for the RMS distance, we present a new ε-approximation algorithm that runs in O(n^5/4poly{log n,1/ε}) time. Our algorithm is inspired by a recent approach for finding a minimum-cost perfect matching in bipartite planar graphs (Asathulla et al., TALG 2020). Their algorithm depends heavily on the existence of sub-linear sized vertex separators as well as shortest path data structures that require planarity. Surprisingly, we are able to design a similar algorithm for a complete geometric graph that is far from planar and does not have any vertex separators. Central components of our algorithm include a quadtree-based distance that approximates the squared Euclidean distance and a data structure that supports both Hungarian search and augmentation in sub-linear time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/15/2021

Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane

Given two sets S and T of points in the plane, of total size n, a many-t...
research
09/24/2019

Conditional Hardness of Earth Mover Distance

The Earth Mover Distance (EMD) between two sets of points A, B ⊆R^d with...
research
11/07/2022

A deterministic near-linear time approximation scheme for geometric transportation

Given a set of points P = (P^+ ⊔ P^-) ⊂ℝ^d for some constant d and a sup...
research
07/19/2022

Algorithms for the Euclidean Bipartite Edge Cover Problem

Given a graph G=(V,E) with costs on its edges, the minimum-cost edge cov...
research
04/08/2022

Deterministic, Near-Linear ε-Approximation Algorithm for Geometric Bipartite Matching

Given point sets A and B in ℝ^d where A and B have equal size n for some...
research
03/05/2019

A linear-time algorithm and analysis of graph Relative Hausdorff distance

Graph similarity metrics serve far-ranging purposes across many domains ...
research
11/27/2018

Tackling Early Sparse Gradients in Softmax Activation Using Leaky Squared Euclidean Distance

Softmax activation is commonly used to output the probability distributi...

Please sign up or login with your details

Forgot password? Click here to reset