Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance
نویسندگان
چکیده
Consider a sum-product normed space, i.e. a space of the form Y = `1 ⊗ X , where X is another normed space. Each element in Y consists of a length-n vector of elements in X , and the norm of an element in Y is the sum of the norms of its coordinates. In this paper we show a constant-distortion embedding from the normed space `1 ⊗X into a lower-dimensional normed space ` ′ 1 ⊗ X , where n′ n is some value that depends on the properties of the normed space X (namely, on its Rademacher dimension). In particular, composing this embedding with another well-known embedding of Indyk [18], we get anO(1/ )-distortion embedding from the earth-mover metric EMD∆ on the grid [∆] to ` O( ) 1 ⊗EEMD∆ (where EEMD is a norm that generalizes earth-mover distance). This embedding is stronger (and simpler) than the sketching algorithm of Andoni et al [4], which maps EMD∆ withO(1/ ) approximation into sketches of size ∆ .
منابع مشابه
From the Cover: Simplifying the representation of complex free-energy landscapes using sketch-map.
A new scheme, sketch-map, for obtaining a low-dimensional representation of the region of phase space explored during an enhanced dynamics simulation is proposed. We show evidence, from an examination of the distribution of pairwise distances between frames, that some features of the free-energy surface are inherently high-dimensional. This makes dimensionality reduction problematic because the...
متن کاملInverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملSketching Earth-Mover Distance on Graph Metrics
We develop linear sketches for estimating the Earth-Mover distance between two point sets, i.e., the cost of the minimum weight matching between the points according to some metric. While Euclidean distance and Edit distance are natural measures for vectors and strings respectively, Earth-Mover distance is a well-studied measure that is natural in the context of visual or metric data. Our work ...
متن کاملResearch in Algorithms for Geometric Pattern Matching MIT 2001 - 06 Progress Report : January 1 , 2002 – June 30 , 2002
During the period of January-June 2002, the main focus of this project was implementing and evaluating algorithms for embedding Earth-Mover Distance into the Euclidean space. Earth-mover distance (EMD) is a recently proposed metric for computing distance between features of images (see [EMD] and references therein). It was experimentally verified to capture well the perceptual notion of a diffe...
متن کاملOn the relation between the relative earth mover distance and the variation distance (an exposition)
In this note we present a proof that the variation distance up to relabeling is upperbounded by the “relative earth mover distance” (to be defined below). The relative earth mover distance was introduced by Valiant and Valiant [VV11], and was extensively used in their work. The foregoing claim was made in [VV11], but was not used there. The claim appears a special case of [VV15, Fact 1] (i.e., ...
متن کامل