Efficient Algorithms for the Earth Mover's Distance from Average Distortion Embeddings
- đ¤ Speaker: Erik Waingarten (Pennsylvania State University)
- đ Date & Time: Tuesday 22 July 2025, 13:30 - 14:20
- đ Venue: External
Abstract
We give new algorithmic primitives for the Earth Mover’s Distance (EMD), and as a result, improve the best approximation for nearest neighbor search under EMD by a quadratic factor. Here, the metric EMD _s(Rd,\ell_p) consists of sets of s vectors in Rd, and for any two sets x,y of s vectors the distance EMD is the minimum cost of a perfect matching between x,y, where the cost of matching two vectors is their \ell_p distance. Previously, Andoni, Indyk, and Krauthgamer gave a bi-Lipschitz embedding of EMD _s([Delta]^d,\ell_p) when p in [1,2] to l_1 with approximation O(log s log(dDelta)). By using “data-dependent” trees, we give average-distortion embeddings with distortion \tilde{O}(log s).
Series This talk is part of the Isaac Newton Institute Seminar Series series.
Included in Lists
- All CMS events
- bld31
- dh539
- External
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Erik Waingarten (Pennsylvania State University)
Tuesday 22 July 2025, 13:30-14:20