paper-with-me

홈 › Papers

On Outer Bi-Lipschitz Extensions of Linear Johnson-Lindenstrauss Embeddings of Low-Dimensional Submanifolds of $\mathbb{R}^N$

2022-06-07 · Mark A. Iwen, Mark Philip Roach

Let $\mathcal{M}$ be a compact $d$-dimensional submanifold of $\mathbb{R}^N$ with reach $\tau$ and volume $V_{\mathcal M}$. Fix $\epsilon \in (0,1)$. In this paper we prove that a nonlinear function $f: \mathbb{R}^N \rightarrow \mathbb{R}^{m}$ exists with $m \leq C \left(d / \epsilon^2 \right) \log \left(\frac{\sqrt[d]{V_{\mathcal M}}}{\tau} \right)$ such that $$(1 - \epsilon) \| {\bf x} - {\bf y} \|_2 \leq \left\| f({\bf x}) - f({\bf y}) \right\|_2 \leq (1 + \epsilon) \| {\bf x} - {\bf y} \|_2$$ holds for all ${\bf x} \in \mathcal{M}$ and ${\bf y} \in \mathbb{R}^N$. In effect, $f$ not only serves as a bi-Lipschitz function from $\mathcal{M}$ into $\mathbb{R}^{m}$ with bi-Lipschitz constants close to one, but also approximately preserves all distances from points not in $\mathcal{M}$ to all points in $\mathcal{M}$ in its image. Furthermore, the proof is constructive and yields an algorithm which works well in practice. In particular, it is empirically demonstrated herein that such nonlinear functions allow for more accurate compressive nearest neighbor classification than standard linear Johnson-Lindenstrauss embeddings do in practice.

📄 PDF Abstract BibTeX arXiv:2206.03376

Code (1)

markphiliproach/terminalembedding 공식 구현

Similar Papers 제목 키워드 기반

Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extensions

2018-11-08 · Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya Razenshteyn

We introduce and study the notion of an outer bi-Lipschitz extension of a map between Euclidean spaces. The notion is a natural analogue of the notion of a Lipschitz extension of a Lipschitz map. We show that for every m…

Dimensionality ReductionLEMMAOpen-Ended Question Answering

A Johnson-Lindenstrauss Framework for Randomly Initialized CNNs

2021-09-29 · ICLR 2022 4 · Ido Nachum, Jan Hazla, Michael Gastpar, Anatoly Khina

How does the geometric representation of a dataset change after the application of each randomly initialized layer of a neural network? The celebrated Johnson-Lindenstrauss lemma answers this question for linear fully-co…

LEMMA

A Johnson--Lindenstrauss Framework for Randomly Initialized CNNs

2021-11-03 · Ido Nachum, Jan Hązła, Michael Gastpar, Anatoly Khina

How does the geometric representation of a dataset change after the application of each randomly initialized layer of a neural network? The celebrated Johnson--Lindenstrauss lemma answers this question for linear fully-c…

LEMMA

Johnson-Lindenstrauss Lemma, Linear and Nonlinear Random Projections, Random Fourier Features, and Random Kitchen Sinks: Tutorial and Survey

2021-08-09 · Benyamin Ghojogh, Ali Ghodsi, Fakhri Karray, Mark Crowley

This is a tutorial and survey paper on the Johnson-Lindenstrauss (JL) lemma and linear and nonlinear random projections. We start with linear random projection and then justify its correctness by JL lemma and its proof. …

Dimensionality ReductionLEMMA

Toward a unified theory of sparse dimensionality reduction in Euclidean space

2013-11-11 · Jean Bourgain, Sjoerd Dirksen, Jelani Nelson

Let $\Phi\in\mathbb{R}^{m\times n}$ be a sparse Johnson-Lindenstrauss transform [KN14] with $s$ non-zeroes per column. For a subset $T$ of the unit sphere, $\varepsilon\in(0,1/2)$ given, we study settings for $m,s$ requi…

compressed sensingDimensionality ReductionLEMMA