Let $\mathcal{M}$ be a smooth $d$-dimensional submanifold of $\mathbb{R}^N$ with boundary that's equipped with the Euclidean (chordal) metric, and choose $m \leq N$. In this paper we consider the probability that a random matrix $A \in \mathbb{R}^{m \times N}$ will serve as a bi-Lipschitz function $A: \mathcal{M} \rightarrow \mathbb{R}^m$ with bi-Lipschitz constants close to one for three different types of distributions on the $m \times 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 $\mathbb{R}^N$ by allowing for the presence of boundary while also retaining, and in some cases i...
Abstract We propose a scheme for recycling Gaussian random vectors into structured matrices to appro...
Let \(\Phi \in \mathbb{R}^{m×n}\) be a sparse Johnson-Lindenstrauss transform [KN14] with s non-zero...
International audienceWe consider the problem of embedding a low-dimensional set, M, from an infinit...
Let $\mathcal{M}$ be a compact $d$-dimensional submanifold of $\mathbb{R}^N$ with reach $\tau$ and v...
We consider the problem of embedding a subset of $\mathbb{R}^n$ into a low-dimensional Hamming cube ...
Recently, many works have focused on the characterization of non-linear dimensionality reduction met...
The Johnson-Lindenstrauss lemma is a fundamental result in probability with several applications in ...
In this paper, we present novel constructions of matrices with the restricted isometry property (RIP...
We provide a deterministic construction of the sparse Johnson-Lindenstrauss transform of Kane & Nels...
The Johnson-Lindenstrauss Lemma asserts that a set of n points in any Euclidean space can be mapped ...
Johnson and Lindenstrauss (1984) proved that any finite set of data in a high dimensional space can b...
We study representations of data from an arbitrary metric space $\mathcal{X}$ in the space of univar...
This paper investigates theoretical properties of subsampling and hashing as tools for approximate E...
Let $X$ be a symmetric, isotropic random vector in $\mathbb{R}^m$ and let $X_1...,X_n$ be independen...
Low-distortion embeddings are critical building blocks for developing random sampling and random pro...
Abstract We propose a scheme for recycling Gaussian random vectors into structured matrices to appro...
Let \(\Phi \in \mathbb{R}^{m×n}\) be a sparse Johnson-Lindenstrauss transform [KN14] with s non-zero...
International audienceWe consider the problem of embedding a low-dimensional set, M, from an infinit...
Let $\mathcal{M}$ be a compact $d$-dimensional submanifold of $\mathbb{R}^N$ with reach $\tau$ and v...
We consider the problem of embedding a subset of $\mathbb{R}^n$ into a low-dimensional Hamming cube ...
Recently, many works have focused on the characterization of non-linear dimensionality reduction met...
The Johnson-Lindenstrauss lemma is a fundamental result in probability with several applications in ...
In this paper, we present novel constructions of matrices with the restricted isometry property (RIP...
We provide a deterministic construction of the sparse Johnson-Lindenstrauss transform of Kane & Nels...
The Johnson-Lindenstrauss Lemma asserts that a set of n points in any Euclidean space can be mapped ...
Johnson and Lindenstrauss (1984) proved that any finite set of data in a high dimensional space can b...
We study representations of data from an arbitrary metric space $\mathcal{X}$ in the space of univar...
This paper investigates theoretical properties of subsampling and hashing as tools for approximate E...
Let $X$ be a symmetric, isotropic random vector in $\mathbb{R}^m$ and let $X_1...,X_n$ be independen...
Low-distortion embeddings are critical building blocks for developing random sampling and random pro...
Abstract We propose a scheme for recycling Gaussian random vectors into structured matrices to appro...
Let \(\Phi \in \mathbb{R}^{m×n}\) be a sparse Johnson-Lindenstrauss transform [KN14] with s non-zero...
International audienceWe consider the problem of embedding a low-dimensional set, M, from an infinit...