The Andoni--Krauthgamer--Razenshteyn characterization of sketchable norms fails for sketchable metrics
Subhash Khot, Assaf Naor

TL;DR
This paper demonstrates that the AKR characterization of sketchable norms does not extend to all metric spaces, providing counterexamples of large metric spaces that are sketchable but lack bounded embeddings into -psilon spaces.
Contribution
The authors construct large metric spaces that are sketchable yet cannot be embedded into -psilon spaces with bounded distortion, disproving the extension of AKR's characterization beyond normed spaces.
Findings
Existence of arbitrarily large sketchable metric spaces with unbounded embedding distortion.
Counterexamples show AKR's characterization fails for general metric spaces.
The result clarifies the limitations of geometric embeddings in sketching algorithms.
Abstract
Andoni, Krauthgamer and Razenshteyn (AKR) proved (STOC 2015) that a finite-dimensional normed space admits a sketching algorithm (namely, with sketch size and approximation) if and only if for every there exist and an embedding such that for all . The "if part" of this theorem follows from a sketching algorithm of Indyk (FOCS 2000). The contribution of AKR is therefore to demonstrate that the mere availability of a sketching algorithm implies the existence of the aforementioned geometric realization. Indyk's algorithm shows that the "if part" of the AKR characterization holds true for any metric space whatsoever, i.e., the existence of an embedding as above implies sketchability even when…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Complexity and Algorithms in Graphs · 3D Shape Modeling and Analysis
