Ultra-low-dimensional embeddings of doubling metrics

Slides:



Advertisements
Similar presentations
Routing Complexity of Faulty Networks Omer Angel Itai Benjamini Eran Ofek Udi Wieder The Weizmann Institute of Science.
Advertisements

Quantum Lovasz local lemma Andris Ambainis (Latvia), Julia Kempe (Tel Aviv), Or Sattath (Hebrew U.) arXiv:
Embedding Metric Spaces in Their Intrinsic Dimension Ittai Abraham, Yair Bartal*, Ofer Neiman The Hebrew University * also Caltech.
On allocations that maximize fairness Uriel Feige Microsoft Research and Weizmann Institute.
Vertex sparsifiers: New results from old techniques (and some open questions) Robert Krauthgamer (Weizmann Institute) Joint work with Matthias Englert,
Informational Complexity Notion of Reduction for Concept Classes Shai Ben-David Cornell University, and Technion Joint work with Ami Litman Technion.
Shortest Vector In A Lattice is NP-Hard to approximate
A Nonlinear Approach to Dimension Reduction Robert Krauthgamer Weizmann Institute of Science Joint work with Lee-Ad Gottlieb TexPoint fonts used in EMF.
Distance Preserving Embeddings of Low-Dimensional Manifolds Nakul Verma UC San Diego.
Lower Bound for Sparse Euclidean Spanners Presented by- Deepak Kumar Gupta(Y6154), Nandan Kumar Dubey(Y6279), Vishal Agrawal(Y6541)
Ioannis Caragiannis, Jason A. Covey, Michal Feldman, Christopher M. Homan, Christos Kaklamanis, Nikos Karanikolask, Ariel D. Procaccia, Je ff rey S. Rosenschein.
Embedding the Ulam metric into ℓ 1 (Ενκρεβάτωση του μετρικού χώρου Ulam στον ℓ 1 ) Για το μάθημα “Advanced Data Structures” Αντώνης Αχιλλέως.
Overcoming the L 1 Non- Embeddability Barrier Robert Krauthgamer (Weizmann Institute) Joint work with Alexandr Andoni and Piotr Indyk (MIT)
Trees and Markov convexity James R. Lee Institute for Advanced Study [ with Assaf Naor and Yuval Peres ] RdRd x y.
A Metric Notion of Dimension and Its Applications to Learning Robert Krauthgamer (Weizmann Institute) Based on joint works with Lee-Ad Gottlieb, James.
Metric Embeddings with Relaxed Guarantees Hubert Chan Joint work with Kedar Dhamdhere, Anupam Gupta, Jon Kleinberg, Aleksandrs Slivkins.
Metric embeddings, graph expansion, and high-dimensional convex geometry James R. Lee Institute for Advanced Study.
Geometric embeddings and graph expansion James R. Lee Institute for Advanced Study (Princeton) University of Washington (Seattle)
A Nonlinear Approach to Dimension Reduction Lee-Ad Gottlieb Weizmann Institute of Science Joint work with Robert Krauthgamer TexPoint fonts used in EMF.
Navigating Nets: Simple algorithms for proximity search Robert Krauthgamer (IBM Almaden) Joint work with James R. Lee (UC Berkeley)
Hard Metrics from Cayley Graphs Yuri Rabinovich Haifa University Joint work with Ilan Newman.
Advances in Metric Embedding Theory Ofer Neiman Ittai Abraham Yair Bartal Hebrew University.
Single Sink Edge Installation Kunal Talwar UC Berkeley.
Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs Y. Rabinovich R. Raz DCG 19 (1998) Iris Reinbacher COMP 670P
Dimensionality Reduction
Doubling Dimension in Real-World Graphs Melitta Lorraine Geistdoerfer Andersen.
Embedding and Sketching Alexandr Andoni (MSR). Definition by example  Problem: Compute the diameter of a set S, of size n, living in d-dimensional ℓ.
Random Projections of Signal Manifolds Michael Wakin and Richard Baraniuk Random Projections for Manifold Learning Chinmay Hegde, Michael Wakin and Richard.
cover times, blanket times, and majorizing measures Jian Ding U. C. Berkeley James R. Lee University of Washington Yuval Peres Microsoft Research TexPoint.
Distance scales, embeddings, and efficient relaxations of the cut cone James R. Lee University of California, Berkeley.
Volume distortion for subsets of R n James R. Lee Institute for Advanced Study & University of Washington Symposium on Computational Geometry, 2006; Sedona,
Algorithms on negatively curved spaces James R. Lee University of Washington Robert Krauthgamer IBM Research (Almaden) TexPoint fonts used in EMF. Read.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Adaptive nonlinear manifolds and their applications to pattern.
Quantum Computing MAS 725 Hartmut Klauck NTU TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A.
Fast, precise and dynamic distance queries Yair BartalHebrew U. Lee-Ad GottliebWeizmann → Hebrew U. Liam RodittyBar Ilan Tsvi KopelowitzBar Ilan → Weizmann.
13 th Nov Geometry of Graphs and It’s Applications Suijt P Gujar. Topics in Approximation Algorithms Instructor : T Kavitha.
Cover times, blanket times, and the GFF Jian Ding Berkeley-Stanford-Chicago James R. Lee University of Washington Yuval Peres Microsoft Research.
Geometric Problems in High Dimensions: Sketching Piotr Indyk.
Doubling Dimension: a short survey Anupam Gupta Carnegie Mellon University Barriers in Computational Complexity II, CCI, Princeton.
A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities.
Lower Bounds for Embedding Edit Distance into Normed Spaces A. Andoni, M. Deza, A. Gupta, P. Indyk, S. Raskhodnikova.
On the Impossibility of Dimension Reduction for Doubling Subsets of L p Yair Bartal Lee-Ad Gottlieb Ofer Neiman.
Advances in Metric Embedding Theory Yair Bartal Hebrew University &Caltech UCLA IPAM 07.
Oct 23, 2005FOCS Metric Embeddings with Relaxed Guarantees Alex Slivkins Cornell University Joint work with Ittai Abraham, Yair Bartal, Hubert Chan,
Approximate Near Neighbors for General Symmetric Norms
The Johns Hopkins University
Dimension reduction for finite trees in L1
Generalized Sparsest Cut and Embeddings of Negative-Type Metrics
Advances in Metric Embedding Theory
Sketching and Embedding are Equivalent for Norms
Turnstile Streaming Algorithms Might as Well Be Linear Sketches
Lecture 16: Earth-Mover Distance
Light Spanners for Snowflake Metrics
Yair Bartal Lee-Ad Gottlieb Hebrew U. Ariel University
Overcoming the L1 Non-Embeddability Barrier
Sampling in Graphs: node sparsifiers
Embedding and Sketching
Metric Methods and Approximation Algorithms
Dimension versus Distortion a.k.a. Euclidean Dimension Reduction
Embedding Metrics into Geometric Spaces
Lecture 03: K-nearest neighbors
Estimation from Quantized Signals
Lecture 15: Least Square Regression Metric Embeddings
The Intrinsic Dimension of Metric Spaces
Clustering.
2.2 Linear relations and functions.
President’s Day Lecture: Advanced Nearest Neighbor Search
PRESENTED BY Dr.U.KARUPPIAH DEPARTMENT OF MATHEMATICS
Hierarchical Routing in Networks with Bounded Doubling Dimension
Routing in Networks with Low Doubling Dimension
Presentation transcript:

Ultra-low-dimensional embeddings of doubling metrics T-H. Hubert Chan Max Planck Institute, Saarbrucken Anupam Gupta Carnegie Mellon University Kunal Talwar Microsoft Research SVC

Doubling Dimension Def: Every ball of radius 2R can be covered by 2k balls of radius R  Doubling dimension = k k has dimension (k) Abstract analog of Euclidean dimension 2R R

Doubling metric Def: Doubling metric = an n-point metric with doubling dimension constant (which is independent of n). Advantage: Robust definition, resistant to distorting points slightly. Points on a constant-dimensional manifold have constant doubling dimension! (Even with small noise.)

Low distortion Embedding A map f: (X,d)m such that for all pairs x,y  X d(x,y) ≤ ║f(x)-f(y)║2 ≤ C d(x,y) Small C  f faithfully represents (X,d) Goal: Given an n-point metric space (X,d) with doubling dimension k, find an embedding into m with small distortion. “Distortion” of the embedding Ideally: dimension m and distortion C should be O(k), independent of n when (X,d) is Euclidean.

Our Results Dimension-Distortion Trade-off Theorem: Take any (not necessarily Euclidean) metric space (X,d) with doubling dimension k. Fix any integer T such that k loglog n ≤ T ≤ ln n. Then there exists a map f:X T into T-dimensional Euclidean space with distortion (dimD) O log n T

Comments on Our Results A non-linear technique for dimensionality reduction. Interesting special cases of the tradeoff: Very low dimension: Dimension k loglog n for distortion ≈ O(log n) Balanced trade-off: Dimension log2/3 n for distortion O(k log2/3 n)

Tools Randomized low-diameter partitioning of doubling metrics Co-ordinates at different scales combined using random +1/-1 linear combinations (reminiscent of random projections) Lovasz Local Lemma used to prove existence of an embedding with the desired bounds.

Future Work Our results apply to all doubling metrics Thus cannot beat distortion O(log n) (there are known lower bounds) Future Work: better for Euclidean metrics ? Ideally: If (X,d) with doubling dimension k embeds into Euclidean space with distortion D, then want an embedding into O(k) dimensional Euclidean space with distortion O(D). Paper at http://www.cs.cmu.edu/~hubert