skip to main content
10.1145/1132516.1132557acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article

Advances in metric embedding theory

Published: 21 May 2006 Publication History

Abstract

Metric Embedding plays an important role in a vast range of application areas such as computer vision, computational biology, machine learning, networking, statistics, and mathematical psychology, to name a few.The theory of metric embedding received much attention in recent years by mathematicians as well as computer scientists and has been applied in many algorithmic applications.A cornerstone of the field is a celebrated theorem of Bourgain which states that every finite metric space on n points embeds in Euclidean space with O(log n) distortion.Bourgain's result is best possible when considering the worst case distortion over all pairs of points in the metric space. Yet, it is possible that an embedding can do much better in terms of the average distortion.Indeed, in most practical applications of metric embedding the main criteria for the quality of an embedding is its average distortion over all pairs.In this paper we provide an embedding with constant average distortion for arbitrary metric spaces, while maintaining the same worst case bound provided by Bourgain's theorem.In fact, our embedding possesses a much stronger property. We define the lq-distortion of a uniformly distributed pair of points. Our embedding achieves the best possible lq-distortion for all 1 ≤ q ≤ ∞ simultaneously.These results have several algorithmic implications, e.g. an O(1) approximation for the unweighted uncapacitated quadratic assignment problem.The results are based on novel embedding methods which improve on previous methods in another important aspect: the dimension.The dimension of an embedding is of very high importance in particular in applications and much effort has been invested in analyzing it. However, no previous result improved the bound on the dimension which can be derived from Bourgain's embedding.We prove that any metric space on n points embeds into Lp with distortion O(log n) in dimension O(log n). This provides an optimal bound on the dimension of the embedding.Somewhat surprisingly, we show that a further small improvement is possible at a small price in the distortion, obtaining an embedding with distortion O(log1+θ n) in optimal dimension O(θ-1 log n/log log n), for any θ > 0. It is worth noting that with the small loss in the distortion this improves upon the best known embedding of arbitrary spaces into Euclidean space, where dimension reduction is used.Our techniques also allow to obtain the optimal distortion for embedding into Lp with nearly tight dimension. For any 1 ≤ p ≤ ⊂ and any 1 ≤ k ≤ p, we give an embedding into Lp with distortion O(⌈ log n/k ⌉) in dimension 2O(k)log n.Underlying our results is a novel embedding method. Probabilistic metric decomposition techniques have played a central role in the field of finite metric embedding in recent years. Here we introduce a novel notion of probabilistic metric decompositions which comes particularly natural in the context of embedding. Our new methodology provides a unified approach to all known results on embedding of arbitrary metric spaces. Moreover, as described above, with some additional ideas they allow to get far stronger results. These metric decompositions seem of independent interest.

References

[1]
I. Abraham, Y. Bartal, H. Chan, K. Dhamdhere, J. Kleiberg A. Gupta, O. Neiman, and A. Slivkins. Metric embedding with relaxed guarantees. FOCS 05, pages 83--100.]]
[2]
I. Abraham, Y. Bartal, and O. Neiman. On Embedding of Finite Metric Spaces into Hilbert Space. Tech. Report, 2006.]]
[3]
S. Arora, J. R. Lee, and A. Naor. Euclidean distortion and the sparsest cut. STOC 05, pages 553--562.]]
[4]
Y. Aumann and Y. Rabani. An o(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput., 27(1):291--301, 1998.]]
[5]
S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. STOC 04, pages 222--231.]]
[6]
V. Athitsos and S. Sclaroff. Database indexing methods for 3d hand pose estimation. In Gesture Workshop, pages 288--299, 2003.]]
[7]
Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. FOCS 96, pages 184--193.]]
[8]
Y. Bartal. On approximating arbitrary metrics by tree metrics. STOC 98, pages 183--193.]]
[9]
Y. Bartal. Graph decomposition lemmas and their role in metric embedding methods. ESA 04, pages 89--97.]]
[10]
Y. Bartal. Embedding Finite Metric Spaces in Low Dimension. Tech. Report, 2006.]]
[11]
Y. Bartal, B. Bollobás, and M. Mendel. Ramsey-type theorems for metric spaces with applications to online problems. In Special issue of Journal of Computer and System Science, 2002.]]
[12]
Y. Bartal, M. Charikar, and D. Raz. Approximating min-sum k-clustering in metric spaces. STOC 01, pages 11--20.]]
[13]
Y. Bartal, N. Linial, M. Mendel, and A. Naor. Limitations to frechet embedding of metric spaces. Israel J. Math., 151: 111-124, 2006.]]
[14]
Y. Bartal, N. Linial, M. Mendel, and A. Naor. On metric ramsey-type phenomena. Annals Math, 162(2): 643--709, 2005.]]
[15]
J. Bourgain. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel J. Math., 52(1-2):46--52, 1985.]]
[16]
G. Calinescu, H. J. Karloff, and Y. Rabani. Approximation algorithms for the 0-extension problem. SODA 01, pages 8--16.]]
[17]
M. Costa, M. Castro, A. I. T. Rowstron, and P. B. Key. Pic: Practical internet coordinates for distance estimation. ICDCS 04, pages 178--187.]]
[18]
R. Cox, F. Dabek, M. F. Kaashoek, J. Li, and R. Morris. Practical, distributed network coordinates. SIGCOMM 04, 34(1):113--118.]]
[19]
G. Even, J. S. Naor, S. Rao, and B. Schieber. Divide-and-conquer approximation algorithms via spreading metrics. J. ACM, 47(4):585--616, 2000.]]
[20]
U. Feige, M. T. Hajiaghayi, and J. R. Lee. Improved approximation algorithms for minimum-weight vertex separators. STOC 05, pages 563--572.]]
[21]
J. Fakcharoenphol, C. Harrelson, S. Rao, and K. Talwar. An improved approximation algorithm for the 0-extension problem. SODA 03, pages 257--265.]]
[22]
J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. STOC 03, pages 448--455.]]
[23]
T. Figiel, J. Lindenstrauss, and V. D. Milman. The dimension of almost spherical sections of convex bodies. Acta Math., 139(1-2):53--94, 1977.]]
[24]
P. Francis, S. Jamin, C. Jin, Y Jin, D. Raz, Y. Shavitt, and L. Zhang. Idmaps: a global internet host distance estimation service. IEEE/ACM Trans. Netw., 9(5):525--540, 2001.]]
[25]
N. Garg, V. V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. STOC 93, pages 698--707.]]
[26]
M. Gromov. Filling Riemannian manifolds. J. Differential Geom., 18(1):1--147, 1983.]]
[27]
E. Halperin, J. Buhler, R. M. Karp, R. Krauthgamer, and B. Westover. Detecting protein sequence conservation via metric embeddings. ISMB 03, pages 122--129.]]
[28]
G. Hjaltason and H. Samet. Contractive embedding methods for similarity searching in metric spaces, Tech. Report, 2000.]]
[29]
G. Hristescu and M. Farach-Colton. Cofe: A scalable method for feature extraction from complex objects. DaWaK 00, pages 358--371.]]
[30]
P. Indyk. Algorithmic applications of low-distortion geometric embeddings. FOCS 01, pages 10--33.]]
[31]
P. Indyk and J. Matoušek. Low-distortion embeddings of finite metric spaces. Handbook of Discrete and Computational Geometry, 2004.]]
[32]
W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. In Conference in modern analysis and probability, pages 189--206. Amer. Math. Soc., 1984.]]
[33]
J. Kleinberg and E. Tardos. Approximation algorithms for classification problems with pairwise relationships: metric labeling and markov random fields. J. ACM, 49(5):616--639, 2002.]]
[34]
J. Kleinberg, A. Slivkins, and T. Wexler. Triangulation and embedding using small sets of beacons. FOCS 04, pages 444--453.]]
[35]
R. Krauthgamer, J. R. Lee, M. Mendel, and A. Naor. Measured descent: A new embedding method for finite metrics. FOCS 04, pages 434--443.]]
[36]
J.B. Kruskal. Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika, 29(1):1--27, 1964.]]
[37]
J. B. Kruskal and M. Wish. Multidimensional Scaling. M. Sage Publications, CA, 1978.]]
[38]
J. R. Lee, M. Mendel, and A. Naor. Metric structures in l1: Dimension, snowflakes, and average distortion. LATIN 04, pages 401--412.]]
[39]
T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM, 46(6):787--832, 1999.]]
[40]
H. Lim, J C. Hou, and C. Choi. Constructing internet coordinate system based on delay measurement. SIGCOMM 03, pages 129--142.]]
[41]
N. Linial. Finite metric spaces- combinatorics, geometry and algorithms. ICM 2002.]]
[42]
N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215--245, 1995.]]
[43]
N. Linial and M. Saks. Decomposing graphs into regions of small diameter. SODA 91, pages 320--330.]]
[44]
J. Matousek. On the distortion required for embedding finite metric spaces into normed spaces. Israel Journal of Mathematics, 93:333--344, 1996.]]
[45]
J. Matousek. Note on bi-lipschitz embeddings into low-dimensional euclidean spaces. Comment. Math. Univ. Carolinae, 31:589--600, 1990.]]
[46]
J. Matousek. On embedding expanders into lp spaces. Israel J. Math., 102:189--197, 1997.]]
[47]
J. Matousek. Lectures on discrete geometry. Springer-Verlag, New York, 2002.]]
[48]
T. S. Eugene Ng and H. Zhang. Predicting internet network distance with coordinates-based approaches. INFOCOM 02, pages 178--187.]]
[49]
P. Pardalos, F. Rendl, and H. Wolkowicz. The quadratic assignment problem: a survey and recent developments. In Quadratic assignment and related problems, pages 1--42. Amer. Math. Soc., 1994.]]
[50]
Y. Rabinovich. On average distortion of embedding metrics into the line and into l1. STOC 03, pages 456--462.]]
[51]
Y. Rabinovich and R. Raz. Lower bounds on the distortion of embedding finite metric spaces in graphs. Discrete & Computational Geometry, 19(1):79--94, 1998.]]
[52]
S. Rao. Small distortion and volume preserving embeddings for planar and Euclidean metrics. SoCG 99, pages 300--306.]]
[53]
S. Rao and A. Richa. New approximation techniques for some ordering problems. SODA 98, pages 211--219.]]
[54]
Y. Shavitt and T. Tankel. Big-bang simulation for embedding network distances in euclidean space. IEEE/ACM Trans. Netw., 12(6):993--1006, 2004.]]
[55]
L. Tang and M. Crovella. Geometric exploration of the landmark selection problem. In PAM, pages 63--72, 2004.]]
[56]
M. Thorup and U. Zwick. Approximate distance oracles. J. ACM, 52(1):1--24, 2005.]]
[57]
B. Wu, G. Lancia, V. Bafna, K. Chao, R. Ravi, and C. Tang. A polynomial time approximation scheme for minimum routing cost spanning trees. SODA 98, pages 21--32.]]

Cited By

View all
  • (2024)Transitional uncertainty with layered intermediate predictionsProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692209(3484-3505)Online publication date: 21-Jul-2024
  • (2024)Dynamic metric embedding into ℓspaceProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692183(2831-2845)Online publication date: 21-Jul-2024
  • (2023)LiteHST: A Tree Embedding based Method for Similarity SearchProceedings of the ACM on Management of Data10.1145/35887151:1(1-26)Online publication date: 30-May-2023
  • Show More Cited By

Index Terms

  1. Advances in metric embedding theory

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing
    May 2006
    786 pages
    ISBN:1595931341
    DOI:10.1145/1132516
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 21 May 2006

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tag

    1. metric embedding

    Qualifiers

    • Article

    Conference

    STOC06
    Sponsor:
    STOC06: Symposium on Theory of Computing
    May 21 - 23, 2006
    WA, Seattle, USA

    Acceptance Rates

    Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

    Upcoming Conference

    STOC '25
    57th Annual ACM Symposium on Theory of Computing (STOC 2025)
    June 23 - 27, 2025
    Prague , Czech Republic

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)49
    • Downloads (Last 6 weeks)6
    Reflects downloads up to 14 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Transitional uncertainty with layered intermediate predictionsProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692209(3484-3505)Online publication date: 21-Jul-2024
    • (2024)Dynamic metric embedding into ℓspaceProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692183(2831-2845)Online publication date: 21-Jul-2024
    • (2023)LiteHST: A Tree Embedding based Method for Similarity SearchProceedings of the ACM on Management of Data10.1145/35887151:1(1-26)Online publication date: 30-May-2023
    • (2023)A spectral method for assessing and combining multiple data visualizationsNature Communications10.1038/s41467-023-36492-214:1Online publication date: 11-Feb-2023
    • (2021)Stability Analysis of the World Energy Trade Structure by Multiscale EmbeddingFrontiers in Energy Research10.3389/fenrg.2021.7296909Online publication date: 29-Sep-2021
    • (2021)Similarity Search in InterPlanetary File System with the Aid of Locality Sensitive HashIEICE Transactions on Information and Systems10.1587/transinf.2020EDP7198E104.D:10(1616-1623)Online publication date: 1-Oct-2021
    • (2021)Randomized Local Network Computing: Derandomization Beyond Locally Checkable LabelingsACM Transactions on Parallel Computing10.1145/34706408:4(1-25)Online publication date: 15-Oct-2021
    • (2021)Auto-FuzzyJoinProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3452824(1064-1076)Online publication date: 9-Jun-2021
    • (2021)Improving Graph Neural Networks with Structural Adaptive Receptive FieldsProceedings of the Web Conference 202110.1145/3442381.3449896(2438-2447)Online publication date: 19-Apr-2021
    • (2020)A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling MetricsACM Transactions on Algorithms10.1145/337857116:2(1-23)Online publication date: 9-Mar-2020
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media