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

by   Mark A. Iwen, et al.

Let ℳ be a smooth d-dimensional submanifold of ℝ^N with boundary that's equipped with the Euclidean (chordal) metric, and choose m ≤ N. In this paper we consider the probability that a random matrix A ∈ℝ^m × N will serve as a bi-Lipschitz function A: ℳ→ℝ^m with bi-Lipschitz constants close to one for three different types of distributions on the m × N matrices A, including two whose realizations are guaranteed to have fast matrix-vector multiplies. In doing so we generalize prior randomized metric space embedding results of this type for submanifolds of ℝ^N by allowing for the presence of boundary while also retaining, and in some cases improving, prior lower bounds on the achievable embedding dimensions m for which one can expect small distortion with high probability. In particular, motivated by recent modewise embedding constructions for tensor data, herein we present a new class of highly structured distributions on matrices which outperform prior structured matrix distributions for embedding sufficiently low-dimensional submanifolds of ℝ^N (with d ≲√(N)) with respect to both achievable embedding dimension, and computationally efficient realizations. As a consequence we are able to present, for example, a general new class of Johnson-Lindenstrauss embedding matrices for 𝒪(log^c N)-dimensional submanifolds of ℝ^N which enjoy 𝒪(N log (log N))-time matrix vector multiplications.


page 1

page 2

page 3

page 4


Lower Bounds on the Low-Distortion Embedding Dimension of Submanifolds of ℝ^n

Let ℳ be a smooth submanifold of ℝ^n equipped with the Euclidean (chorda...

Computing Bi-Lipschitz Outlier Embeddings into the Line

The problem of computing a bi-Lipschitz embedding of a graphical metric ...

Lipschitz bijections between boolean functions

We answer four questions from a recent paper of Rao and Shinkar on Lipsc...

Fast metric embedding into the Hamming cube

We consider the problem of embedding a subset of ℝ^n into a low-dimensio...

Small Transformers Compute Universal Metric Embeddings

We study representations of data from an arbitrary metric space 𝒳 in the...

Faster Johnson-Lindenstrauss Transforms via Kronecker Products

The Kronecker product is an important matrix operation with a wide range...

Fast nonlinear embeddings via structured matrices

We present a new paradigm for speeding up randomized computations of sev...

Please sign up or login with your details

Forgot password? Click here to reset