Near-Optimal (Euclidean) Metric Compression

TL;DR

This paper improves the bounds on the size of sketches needed for near-optimal metric compression in Euclidean and general metrics, significantly reducing the amount of data required to approximate distances.

Contribution

The authors present tighter bounds for metric sketching, improving upon Johnson-Lindenstrauss bounds for Euclidean metrics and establishing optimal bounds for general metrics.

Findings

Euclidean metric sketch size reduced to $O(rac{1}{ ext{epsilon}^2} ext{log}(1/ ext{epsilon}) ext{log} n + ext{loglog} ext{Phi})$ bits per point.

Established that the new bounds are tight up to a $ ext{log}(1/ ext{epsilon})$ factor.

Provided an optimal sketch size of $O(n ext{log}(1/ ext{epsilon}) + ext{loglog} ext{Phi})$ bits per point for general metrics.

Abstract

The metric sketching problem is defined as follows. Given a metric on $n$ points, and $\epsilon>0$, we wish to produce a small size data structure (sketch) that, given any pair of point indices, recovers the distance between the points up to a $1+\epsilon$ distortion. In this paper we consider metrics induced by $\ell_2$ and $\ell_1$ norms whose spread (the ratio of the diameter to the closest pair distance) is bounded by $\Phi>0$. A well-known dimensionality reduction theorem due to Johnson and Lindenstrauss yields a sketch of size $O(\epsilon^{-2} \log (\Phi n) n\log n)$, i.e., $O(\epsilon^{-2} \log (\Phi n) \log n)$ bits per point. We show that this bound is not optimal, and can be substantially improved to $O(\epsilon^{-2}\log(1/\epsilon) \cdot \log n + \log\log \Phi)$ bits per point. Furthermore, we show that our bound is tight up to a factor of $\log(1/\epsilon)$. We also consider sketching of general metrics and provide a sketch of size $O(n\log(1/\epsilon)+ \log\log \Phi)$ bits per point, which we show is optimal.