Lossless Prioritized Embeddings
Michael Elkin, Ofer Neiman
Abstract
Given metric spaces (X, d) and (Y, ρ) and an ordering x 1 , x 2 , . . . , x n of (X, d), an embedding f : X → Y is said to have a prioritized distortion α(•), for a function α(•), if for any pair x j , x of distinct points in X, the distortion provided by f for this pair is at most α(j). If Y is a normed space, the embedding is said to have prioritized dimension β(•), if f (x j ) may have non-zero entries only in its first β(j) coordinates.
The notion of prioritized embedding was introduced by Filtser and the current authors in [EFN18], where a rather general methodology for constructing such embeddings was developed. Though this methodology enables [EFN18] to come up with many prioritized embeddings, it typically incurs some loss in the distortion. In other words, in the worst-case, prioritized embeddings obtained via this methodology incur distortion which is at least a constant factor off, compared to the distortion of the classical counterparts of these embeddings. This constant loss is problematic for isometric embeddings. It is also troublesome for Matousek's embedding of general metrics into ℓ ∞ , which for a parameter k = 1, 2, . . ., provides distortion 2k -1 and dimension O(k log n • n 1/k ).
In this paper we devise two lossless prioritized embeddings. The first one is an isometric prioritized embedding of tree metrics into ℓ ∞ with dimension O(log j), matching the worst-case guarantee of O(log n) of the classical embedding of Linial et al. [LLR95]. The second one is a prioritized Matousek's embedding of general metrics into ℓ ∞ , which for a parameter k = 1, 2, . . ., provides prioritized distortion 2 k log j log n -1 and dimension O(k log n • n 1/k ), again matching the worst-case guarantee 2k -1 in the distortion of the classical Matousek's embedding.
We also provide a dimension-prioritized variant of Matousek's embedding. Finally, we devise prioritized embeddings of general metrics into (single) ultra-metric and of general graphs into (single) spanning tree with asymptotically optimal distortion.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers3
- Hop-Constrained Metric Embeddings and their ApplicationsArnold FiltserFOCS 2021 · 9 citations
- Labelings vs. Embeddings: On Distributed Representations of DistancesArnold Filtser, Lee-Ad Gottlieb, Robert KrauthgamerSODA 2020 · 5 citations
- Online Duet between Metric Embeddings and Minimum-Weight Perfect MatchingsSujoy Bhore, Arnold Filtser, Csaba D. TóthSODA 2024 · 4 citations
Builds on1
Related papers
- Fully Dynamic Embedding into ℓp SpacesKiarash Banihashem, Xiang Chen, MohammadTaghi Hajiaghayi, Sungchul Kim et al.ICML 2025
- On Efficient Low Distortion Ultrametric EmbeddingVincent Cohen-Addad, Karthik C. S., Guillaume LagardeICML 2020 · 13 citations
- Dynamic Metric Embedding into lp SpaceKiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz Rafal Kowalski, Jan Olkowski et al.ICML 2024 · 1 citation
- Composition of nested embeddings with an application to outlier removalShuchi Chawla, Kristin SheridanSODA 2024
- Terminal Embeddings in Sublinear TimeYeshwanth Cherapanamjeri, Jelani NelsonFOCS 2021 · 5 citations
