English
Related papers

Related papers: Nonlinear Dimension Reduction via Outer Bi-Lipschi…

200 papers

We investigate a linearised Calder\'on problem in a two-dimensional bounded simply connected $C^{1,\alpha}$ domain $\Omega$. After extending the linearised problem for $L^2(\Omega)$ perturbations, we orthogonally decompose $L^2(\Omega) =…

Analysis of PDEs · Mathematics 2024-05-24 Henrik Garde , Nuutti Hyvönen

For a set $X$ of $N$ points in $\mathbb{R}^D$, the Johnson-Lindenstrauss lemma provides random linear maps that approximately preserve all pairwise distances in $X$ -- up to multiplicative error $(1\pm \epsilon)$ with high probability --…

Probability · Mathematics 2023-07-18 Michael P. Casey

We study the asymmetry of the Lipschitz metric d on Outer space. We introduce an (asymmetric) Finsler norm that induces d. There is an Out(F_n)-invariant potential \Psi on Outer space such that when the Lipschitz norm is corrected by the…

Group Theory · Mathematics 2011-03-25 Yael Algom-Kfir , Mladen Bestvina

We provide a new characterisation of the decades old open problem of extending bilipschitz mappings given on a Euclidean separated net. In particular, this allows for the complete positive solution of the open problem in dimension two.…

Metric Geometry · Mathematics 2026-03-20 Michael Dymond , Vojtěch Kaluža

We consider two questions on the geometry of Lipschitz free $p$-spaces $\mathcal F_p$, where $0<p\leq 1$, over subsets of finite-dimensional vector spaces. We solve an open problem and show that if $(\mathcal M, \rho)$ is an infinite…

Functional Analysis · Mathematics 2023-03-07 Jan Bíma

Recently (Elkin, Filtser, Neiman 2017) introduced the concept of a {\it terminal embedding} from one metric space $(X,d_X)$ to another $(Y,d_Y)$ with a set of designated terminals $T\subset X$. Such an embedding $f$ is said to have…

Data Structures and Algorithms · Computer Science 2024-08-07 Yeshwanth Cherapanamjeri , Jelani Nelson

The Johnson-Lindenstrauss lemma is one of the corner stone results in dimensionality reduction. It says that given $N$, for any set of $N$ vectors $X \subset \mathbb{R}^n$, there exists a mapping $f : X \to \mathbb{R}^m$ such that $f(X)$…

Functional Analysis · Mathematics 2017-11-09 Casper Benjamin Freksen , Kasper Green Larsen

Lipschitz decomposition is a useful tool in the design of efficient algorithms involving metric spaces. While many bounds are known for different families of finite metrics, the optimal parameters for $n$-point subsets of $\ell_p$, for $p >…

Computational Geometry · Computer Science 2026-02-23 Robert Krauthgamer , Nir Petruschka

We generalize a bi-Lipschitz extension result of David and Semmes from Euclidean spaces to complete metric measure spaces with controlled geometry (Ahlfors regularity and supporting a Poincar\'e inequality). In particular, we find sharp…

Metric Geometry · Mathematics 2024-03-14 Jacob Honeycutt , Vyron Vellis , Scott Zimmerman

We consider a stochastic version of the proximal point algorithm for optimization problems posed on a Hilbert space. A typical application of this is supervised learning. While the method is not new, it has not been extensively analyzed in…

Optimization and Control · Mathematics 2021-09-28 Monika Eisenmann , Tony Stillfjord , Måns Williamson

The Johnson-Lindenstrauss (JL) lemma is a cornerstone of dimensionality reduction in Euclidean space, but its applicability to non-Euclidean data has remained limited. This paper extends the JL lemma beyond Euclidean geometry to handle…

Data Structures and Algorithms · Computer Science 2025-10-28 Chengyuan Deng , Jie Gao , Kevin Lu , Feng Luo , Cheng Xin

A classical result of Johnson and Lindenstrauss states that a set of $n$ high dimensional data points can be projected down to $O(\log n/\epsilon^2)$ dimensions such that the square of their pairwise distances is preserved up to a small…

Data Structures and Algorithms · Computer Science 2023-06-02 Aleksandros Sobczyk , Mathieu Luisier

The main question studied in this article may be viewed as a nonlinear analogue of Dvoretzky's theorem in Banach space theory or as part of Ramsey theory in combinatorics. Given a finite metric space on n points, we seek its subspace of…

Metric Geometry · Mathematics 2012-11-15 Yair Bartal , Nathan Linial , Manor Mendel , Assaf Naor

We prove that every $L$-bilipschitz mapping $\mathbb{Z}^2\to\mathbb{R}^2$ can be extended to a $C(L)$-bilipschitz mapping $\mathbb{R}^2\to\mathbb{R}^2$ and provide a polynomial upper bound for $C(L)$. Moreover, we extend the result to every…

Metric Geometry · Mathematics 2026-03-20 Michael Dymond , Vojtěch Kaluža

The optimal Orlicz target space is exhibited for embeddings of fractional-order Orlicz-Sobolev spaces in $\mathbb R^n$. An improved embedding with an Orlicz-Lorentz target space, which is optimal in the broader class of all…

Functional Analysis · Mathematics 2020-01-17 Angela Alberico , Andrea Cianchi , Luboš Pick , Lenka Slavíková

Fix $k \in \mathbb{N}$ and $0 < \delta < 1$. We study how large $N$ must be so that every $\delta$-dense subset $\mathcal{D} \subset \{0,1\}^N$ (meaning $|\mathcal{D}| \geq \delta 2^N$) contains the image of a metric embedding $f: \{0,1\}^k…

Combinatorics · Mathematics 2026-03-06 Miltiadis Karamanlis , Cosmas Kravaris

The problems of random projections and sparse reconstruction have much in common and individually received much attention. Surprisingly, until now they progressed in parallel and remained mostly separate. Here, we employ new tools from…

Data Structures and Algorithms · Computer Science 2010-06-01 Nir Ailon , Edo Liberty

We show that inclusions of $p$-metric spaces always produce genuine linear embeddings at the level of Lipschitz-free $p$-spaces. More precisely, for every $0<p<1$ and every inclusion $ \mathit{N}\subset \mathit{M}$ of $p$-metric spaces, the…

Functional Analysis · Mathematics 2026-03-31 Fernando Albiac , José L. Ansorena

Let $X$ be a normed space that satisfies the Johnson-Lindenstrauss lemma (J-L lemma, in short) in the sense that for any integer $n$ and any $x_1,\ldots,x_n\in X$ there exists a linear mapping $L:X\to F$, where $F\subseteq X$ is a linear…

Functional Analysis · Mathematics 2008-07-29 William B. Johnson , Assaf Naor

Despite many applications, dimensionality reduction in the $\ell_1$-norm is much less understood than in the Euclidean norm. We give two new oblivious dimensionality reduction techniques for the $\ell_1$-norm which improve exponentially…

Data Structures and Algorithms · Computer Science 2021-08-09 Yi Li , David P. Woodruff , Taisuke Yasuda