Fast metric embedding into the Hamming cube

04/08/2022
by   Sjoerd Dirksen, et al.
0

We consider the problem of embedding a subset of ℝ^n into a low-dimensional Hamming cube in an almost isometric way. We construct a simple and computationally efficient map that achieves this task with high probability: we first apply a specific structured random matrix, which we call the double circulant matrix; using that matrix requires little storage and matrix-vector multiplication can be performed in near-linear time. We then binarize each vector by comparing each of its entries to a random threshold, selected uniformly at random from a well-chosen interval. We estimate the number of bits required for this encoding scheme in terms of two natural geometric complexity parameters of the set – its Euclidean covering numbers and its localized Gaussian complexity. The estimate we derive turns out to be the best that one can hope for – up to logarithmic terms. The key to the proof is a phenomenon of independent interest: we show that the double circulant matrix mimics the behavior of a Gaussian matrix in two important ways. First, it yields an almost isometric embedding of any subset of ℓ_2^n into ℓ_1^m and, second, it maps an arbitrary set in ℝ^n into a set of well-spread vectors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/17/2020

Binarized Johnson-Lindenstrauss embeddings

We consider the problem of encoding a set of vectors into a minimal numb...
research
10/01/2020

Faster Binary Embeddings for Preserving Euclidean Distances

We propose a fast, distance-preserving, binary embedding algorithm to tr...
research
10/08/2021

On Fast Johnson-Lindenstrauss Embeddings of Compact Submanifolds of ℝ^N with Boundary

Let ℳ be a smooth d-dimensional submanifold of ℝ^N with boundary that's ...
research
09/15/2022

Structure preservation via the Wasserstein distance

We show that under minimal assumptions on a random vector X∈ℝ^d, and wit...
research
07/06/2021

Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube

Using geometric techniques like projection and dimensionality reduction,...
research
03/09/2021

Column randomization and almost-isometric embeddings

The matrix A:ℝ^n →ℝ^m is (δ,k)-regular if for any k-sparse vector x, ...

Please sign up or login with your details

Forgot password? Click here to reset