Optimal randomized clustering for subsets of Lp when p > 2
Assaf Naor, Kevin Ren
2026Year
3Citations
Abstract
We resolve multiple fundamental open questions about the bi-Lipschitz geometry of subsets of for via a novel multiscale and localization framework. Specifically, we prove that the separation modulus of any -point subset of is . If that subset has doubling constant , then we obtain the improved bound , which is new even for the Euclidean space . We also break the longstanding barrier for embedding every -point subset of into Euclidean space for all , as well as the longstanding barrier for their Lipschitz extension modulus.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Related papers
- The Power of Recursive Embeddings for ℓp MetricsRobert Krauthgamer, Nir Petruschka, Shay SapirFOCS 2025 · 7 citations
- Composition of nested embeddings with an application to outlier removalShuchi Chawla, Kristin SheridanSODA 2024
- SVPp Is Deterministically NP-Hard for All p > 2, Even to Approximate within a Factor of 2log1-εnIsaac M. Hair, Amit SahaiSTOC 2026
- The ℓp-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector MachinesYi Li, Honghao Lin, David P. WoodruffSODA 2023
- Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms!Divesh Aggarwal, Rajendra KumarFOCS 2023 · 1 citation
