Ultra-low-dimensional embeddings for doubling metrics

Author:

Chan T.-H. Hubert1,Gupta Anupam2,Talwar Kunal3

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) ≤TO(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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3