Affiliation:
1. The University of Hong Kong, Hong Kong
2. Carnegie Mellon University, Pittsburgh, Pennsylvania
3. Microsoft Research, Silicon Valley Campus, Mountain view, California
Abstract
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical theorems of Bourgain, and of Johnson and Lindenstrauss say that any metric onnpoints embeds into anO(logn)-dimensional Euclidean space withO(logn) distortion. Moreover, a simple “volume” argument shows that this bound is nearly tight: a uniform metric onnpoints requires nearly logarithmic number of dimensions to embed with logarithmic distortion. It is natural to ask whether such a volume restriction is the only hurdle to low-dimensional embeddings. In other words, dodoublingmetrics, that do not have large uniform submetrics, and thus no volume hurdles to low dimensional embeddings, embed in low dimensional Euclidean spaces with small distortion?In this article, we give a positive answer to this question. We show how to embed any doubling metrics intoO(log logn) dimensions withO(logn) distortion. This is the first embedding for doubling metrics into fewer than logarithmic number of dimensions, even allowing for logarithmic distortion.This result is one extreme point of our general trade-off between distortion and dimension: given ann-point metric(V,d)with doubling dimension dimD, and any target dimensionTin the range Ω(dimDlog logn) ≤T≤O(logn), we show that the metric embeds into Euclidean space RTwithO(logn√ dimD/T) distortion.
Funder
Division of Computing and Communication Foundations
National Science Foundation
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics;2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS);2018-10
2. On Hierarchical Routing in Doubling Metrics;ACM Transactions on Algorithms;2016-09-02
3. A Nonlinear Approach to Dimension Reduction;Discrete & Computational Geometry;2015-06-04
4. Low Dimensional Embeddings of Doubling Metrics;Theory of Computing Systems;2014-09-05
5. On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp;Proceedings of the thirtieth annual symposium on Computational geometry;2014-06-08