English
Related papers

Related papers: Composition of nested embeddings with an applicati…

200 papers

We initiate the study of metric embeddings with \emph{outliers}. Given some metric space $(X,\rho)$ we wish to find a small set of outlier points $K \subset X$ and either an isometric or a low-distortion embedding of $(X\setminus K,\rho)$…

Data Structures and Algorithms · Computer Science 2015-08-17 Anastasios Sidiropoulos , Yusu Wang

The problem of computing a bi-Lipschitz embedding of a graphical metric into the line with minimum distortion has received a lot of attention. The best-known approximation algorithm computes an embedding with distortion $O(c^2)$, where $c$…

Data Structures and Algorithms · Computer Science 2020-02-25 Karine Chubarian , Anastasios Sidiropoulos

In this paper, we consider outlier embeddings into HSTs. In particular, for metric $(X,d)$, let $k$ be the size of the smallest subset of $X$ such that all but that subset (the ``outlier set'') can be probabilistically embedded into the…

Data Structures and Algorithms · Computer Science 2026-02-03 Shuchi Chawla , Kristin Sheridan

Metric embeddings are a widely used method in algorithm design, where generally a ``complex'' metric is embedded into a simpler, lower-dimensional one. Historically, the theoretical computer science community has focused on bi-Lipschitz…

Data Structures and Algorithms · Computer Science 2025-05-19 Ainesh Bakshi , Vincent Cohen-Addad , Samuel B. Hopkins , Rajesh Jayaram , Silvio Lattanzi

Euclidean embedding from noisy observations containing outlier errors is an important and challenging problem in statistics and machine learning. Many existing methods would struggle with outliers due to a lack of detection ability. In this…

Machine Learning · Statistics 2020-12-24 Qian Zhang , Xinyuan Zhao , Chao Ding

For a fixed $K\gg 1$ and $n\in\mathbb{N}$, $n\gg 1$, we study metric spaces which admit embeddings with distortion $\le K$ into each $n$-dimensional Banach space. Classical examples include spaces embeddable into $\log n$-dimensional…

Functional Analysis · Mathematics 2016-08-10 Mikhail I. Ostrovskii , Beata Randrianantoanina

Suppose that a metric space $X$ is the union of two metric subspaces $A$ and $B$ that embed into Euclidean space with distortions $D_A$ and $D_B$, respectively. We prove that then $X$ embeds into Euclidean space with a bounded distortion…

Metric Geometry · Mathematics 2017-01-25 Konstantin Makarychev , Yury Makarychev

Distance geometry explores the properties of distance spaces that can be exactly represented as the pairwise Euclidean distances between points in $\mathbb{R}^d$ ($d \geq 1$), or equivalently, distance spaces that can be isometrically…

Computational Geometry · Computer Science 2025-03-26 Matthias Bentert , Fedor V. Fomin , Petr A. Golovach , M. S. Ramanujan , Saket Saurabh

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 map $f$ there exists…

Data Structures and Algorithms · Computer Science 2018-11-09 Sepideh Mahabadi , Konstantin Makarychev , Yury Makarychev , Ilya Razenshteyn

Bilipschitz invariant theory concerns low-distortion embeddings of orbit spaces into Euclidean space. To date, embeddings with the smallest-possible distortion are known for only a few cases, to include: (a) planar rotations, (b) real phase…

Functional Analysis · Mathematics 2026-03-26 Jameson Cahill , Joseph W. Iverson , Dustin G. Mixon , Nathan Willey

The subspace approximation problem with outliers, for given $n$ points in $d$ dimensions $x_{1},\ldots, x_{n} \in R^{d}$, an integer $1 \leq k \leq d$, and an outlier parameter $0 \leq \alpha \leq 1$, is to find a $k$-dimensional linear…

Computational Geometry · Computer Science 2020-07-01 Amit Deshpande , Rameshwar Pratap

This paper is concerned with embeddings of homogeneous spaces into Euclidean spaces. We show that any homogeneous metric space can be embedded into a Hilbert space using an almost bi-Lipschitz mapping (bi-Lipschitz to within logarithmic…

Metric Geometry · Mathematics 2011-02-19 Eric J. Olson , James C. Robinson

We present a relation between sparsity and non-Euclidean isomorphic embeddings. We introduce a general restricted isomorphism property and show how it enables to construct embeddings of $\ell_p^n$, $p > 0$, into various type of Banach or…

Functional Analysis · Mathematics 2011-07-07 Omer Friedland , Olivier Guédon

Fix $p>2$. We prove that the Euclidean distortion of every $n$-point subset of $L_p$ is $p^3(\log n)^{\frac12+o(1)}$, thus, in particular, demonstrating that all $n$-point subsets of $L_p$ exhibit an asymptotic improvement over the $O(\log…

Functional Analysis · Mathematics 2026-03-24 Assaf Naor , Kevin Ren

We construct bi-Lipschitz embeddings into Euclidean space for manifolds and orbifolds of bounded diameter and curvature. The distortion and dimension of such embeddings is bounded by diameter, curvature and dimension alone. Our results also…

Metric Geometry · Mathematics 2018-04-18 Sylvester Eriksson-Bique

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

We consider the problem of computing the smallest possible distortion for embedding of a given n-point metric space into R^d, where d is fixed (and small). For d=1, it was known that approximating the minimum distortion with a factor better…

Computational Geometry · Computer Science 2009-09-29 Jiri Matousek , Anastasios Sidiropoulos

If $X$ is a subset of a Banach space with $X-X$ homogeneous, then $X$ can be embedded into some $\R^n$ (with $n$ sufficiently large) using a linear map $L$ whose inverse is Lipschitz to within logarithmic corrections. More precisely,…

Metric Geometry · Mathematics 2010-07-28 James C Robinson

Oblivious low-distortion subspace embeddings are a crucial building block for numerical linear algebra problems. We show for any real $p, 1 \leq p < \infty$, given a matrix $M \in \mathbb{R}^{n \times d}$ with $n \gg d$, with constant…

Data Structures and Algorithms · Computer Science 2014-03-19 David P. Woodruff , Qin Zhang

In this paper we study {\em terminal embeddings}, in which one is given a finite metric $(X,d_X)$ (or a graph $G=(V,E)$) and a subset $K \subseteq X$ of its points are designated as {\em terminals}. The objective is to embed the metric into…

Data Structures and Algorithms · Computer Science 2016-03-09 Michael Elkin , Arnold Filtser , Ofer Neiman
‹ Prev 1 2 3 10 Next ›