English
Related papers

Related papers: Dimension Reduction in $L_p$, $0<p<2$

200 papers

Let $1<p\not=2<\infty$, $\epsilon>0$ and let $T:\ell_p(\ell_2)\overset{into}{\rightarrow}L_p[0,1]$ be an isomorphism. Then there is a subspace $Y\subset \ell_p(\ell_2)$ $(1+\epsilon)$-isomorphic to $\ell_p(\ell_2)$ such that: $T_{|Y}$ is an…

Functional Analysis · Mathematics 2011-03-02 Ran Levy , Gideon Schechtman

We assume i.i.d. data sampled from a mixture distribution with K components along fixed d-dimensional linear subspaces and an additional outlier component. For p>0, we study the simultaneous recovery of the K fixed subspaces by minimizing…

Machine Learning · Statistics 2015-03-19 Gilad Lerman , Teng Zhang

We prove that for any $2<p<\infty$ and for every $n$-dimensional subspace $X$ of $L_p$, represented on $\mathbb R^n$, whose unit ball $B_X$ is in Lewis' position one has the following two-level Gaussian concentration inequality: \[ \mathbb…

Functional Analysis · Mathematics 2017-10-24 Grigoris Paouris , Petros Valettas

We study the classical spaces $L_{p}$ and $\ell_{p}$ for the whole range $0<p<\infty$ from a metric viewpoint and give a complete Lipschitz embeddability roadmap between any two of those spaces when equipped with both their ad-hoc distances…

Metric Geometry · Mathematics 2017-09-27 Fernando Albiac , Florent Baudier

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

Low-distortion embeddings are critical building blocks for developing random sampling and random projection algorithms for linear algebra problems. We show that, given a matrix $A \in \R^{n \times d}$ with $n \gg d$ and a $p \in [1, 2)$,…

Data Structures and Algorithms · Computer Science 2013-03-22 Xiangrui Meng , Michael W. Mahoney

Enflo and Rosenthal proved that $\ell_p(\aleph_1)$, $1 < p < 2$, does not (isomorphically) embed into $L_p(\mu)$ with $\mu$ a finite measure. We prove that if $X$ is a subspace of an $L_p$ space, $1< p < 2$, and $\ell_p(\aleph_1)$ does not…

Functional Analysis · Mathematics 2013-01-18 William B. Johnson , Gideon Schechtman

We study finite subsets of $\ell_p$ and show that, up to nowhere dense and Haar null complement, all of them embed isometrically into any Banach space that uniformly contains the spaces $\ell_p^n$, $n \in \mathbb{N}$.

Functional Analysis · Mathematics 2017-04-04 James Kilbane

Suppose that we have the unit Euclidean ball in $\R^n$ and construct new bodies using three operations - linear transformations, closure in the radial metric and multiplicative summation defined by $\|x\|_{K+_0L} = \sqrt{\|x\|_K\|x\|_L}.$…

Functional Analysis · Mathematics 2007-05-23 N. J. Kalton , A. Koldobsky , V. Yaskin , M. Yaskina

In this note, we consider the metric Ramsey problem for the normed spaces l_p. Namely, given some 1<=p<=infinity and alpha>=1, and an integer n, we ask for the largest m such that every n-point metric space contains an m-point subspace…

Metric Geometry · Mathematics 2007-05-23 Yair Bartal , Nathan Linial. Manor Mendel , Assaf Naor

Metric embedding is a powerful tool used extensively in mathematics and computer science. We devise a new method of using metric embeddings recursively, which turns out to be particularly effective in $\ell_p$ spaces, $p>2$, yielding…

Computational Geometry · Computer Science 2025-04-08 Robert Krauthgamer , Nir Petruschka , Shay Sapir

We give two different and simple constructions for dimensionality reduction in $\ell_2$ via linear mappings that are sparse: only an $O(\varepsilon)$-fraction of entries in each column of our embedding matrices are non-zero to achieve…

Data Structures and Algorithms · Computer Science 2014-02-07 Daniel M. Kane , Jelani Nelson

The $L_p$-discrepancy is a quantitative measure for the irregularity of distribution of an $N$-element point set in the $d$-dimensional unit cube, which is closely related to the worst-case error of quasi-Monte Carlo algorithms for…

Numerical Analysis · Mathematics 2023-06-13 Erich Novak , Friedrich Pillichshammer

For any finite point set in $D$-dimensional space equipped with the 1-norm, we present random linear embeddings to $k$-dimensional space, with a new metric, having the following properties. For any pair of points from the point set that are…

Probability · Mathematics 2020-11-09 Michael P. Casey

The following theorem is the main result of this note. Theorem 1. Let $(E, \|\cdot\|_E) $ be a rearrangement invariant Banach function space on the interval $[0, 1]$. If $E$ is isometric to $\L_p [0, 1]$ for some $1\le p<\infty$, then $E$…

Functional Analysis · Mathematics 2009-09-25 Yuri A. Abramovich , Mikhail Zaidenberg

We improve the known results about the complexity of the relation of isomorphism between separable Banach spaces up to Borel reducibility, and we achieve this using the classical spaces $c_0$, $\ell_p$ and $L_p$, $1 \leq p <2$. More…

Functional Analysis · Mathematics 2007-05-23 Valentin Ferenczi , Eloi Medina Galego

We present a new proof of a Sundaresan's result which shows that the space of orthogonally additive polynomials $\mathcal{P}_o(^k\ell_p)$ is isometrically isomorphic to $\ell_{p/p-k}$ if $k<p<\infty$ and to $\ell_\infty$ if $1\leq p\leq k$.

Functional Analysis · Mathematics 2012-03-15 A. Ibort , P. Linares , J. G. Llavona

The aim of this paper is twofold. On the one hand, we compute, in terms of $r$ and $s$, the indices $p$ for which $\ell_p$ isomorphically embeds into the mixed-norm separable spaces $L_s(L_r)$, $\ell_s(L_r)$, $L_s(\ell_r)$ and…

Functional Analysis · Mathematics 2025-03-04 José L. Ansorena , Glenier Bello

We present a complete characterization of the metric compactification of $L_{p}$ spaces for $1\leq p < \infty$. Each element of the metric compactification of $L_{p}$ is represented by a random measure on a certain Polish space. By way of…

Functional Analysis · Mathematics 2022-06-01 Armando W. Gutiérrez

We give improved algorithms for the $\ell_{p}$-regression problem, $\min_{x} \|x\|_{p}$ such that $A x=b,$ for all $p \in (1,2) \cup (2,\infty).$ Our algorithms obtain a high accuracy solution in $\tilde{O}_{p}(m^{\frac{|p-2|}{2p + |p-2|}})…

Data Structures and Algorithms · Computer Science 2024-12-20 Deeksha Adil , Rasmus Kyng , Richard Peng , Sushant Sachdeva