Optimal (Euclidean) Metric Compression

10/07/2021
by   Piotr Indyk, et al.
0

We study the problem of representing all distances between n points in ℝ^d, with arbitrarily small distortion, using as few bits as possible. We give asymptotically tight bounds for this problem, for Euclidean metrics, for ℓ_1 (a.k.a. Manhattan) metrics, and for general metrics. Our bounds for Euclidean metrics mark the first improvement over compression schemes based on discretizing the classical dimensionality reduction theorem of Johnson and Lindenstrauss (Contemp. Math. 1984). Since it is known that no better dimension reduction is possible, our results establish that Euclidean metric compression is possible beyond dimension reduction.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/03/2021

On Some Variants of Euclidean K-Supplier

The k-Supplier problem is an important location problem that has been ac...
research
07/14/2021

Optimality of the Johnson-Lindenstrauss Dimensionality Reduction for Practical Measures

It is well known that the Johnson-Lindenstrauss dimensionality reduction...
research
09/24/2021

Non-Euclidean Self-Organizing Maps

Self-Organizing Maps (SOMs, Kohonen networks) belong to neural network m...
research
08/12/2018

Configuration Space Metrics

When robot manipulators decide how to reach for an object, hand it over,...
research
12/13/2022

Dimensionality reduction on complex vector spaces for dynamic weighted Euclidean distance

The weighted Euclidean distance between two vectors is a Euclidean dista...
research
03/17/2023

An evaluation framework for dimensionality reduction through sectional curvature

Unsupervised machine learning lacks ground truth by definition. This pos...
research
10/17/2021

Compression-aware Projection with Greedy Dimension Reduction for Convolutional Neural Network Activations

Convolutional neural networks (CNNs) achieve remarkable performance in a...

Please sign up or login with your details

Forgot password? Click here to reset