The Andoni–Krauthgamer–Razenshteyn characterization of sketchable norms fails for sketchable metrics

Subhash Khot, Assaf Naor

Research output: Contribution to conferencePaper

Abstract

Andoni, Krauthgamer and Razenshteyn (AKR) proved (STOC’15) that a finite-dimensional normed space (X, k·kX) admits a O(1) sketching algorithm (namely, with O(1) sketch size and O(1) approximation) if and only if for every ε ∈ (0, 1) there exist α > 1 and an embedding f : X → `1−ε such that kx − ykX 6 kf(x) − f(y)k1ε 6 αkx − ykX for all x, y ∈ X. 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 X is not a normed space. Due to this, a natural question that AKR posed was whether the assumption that the underlying space is a normed space is needed for their characterization of sketchability. We resolve this question by proving that for arbitrarily large n ∈ N there is an n-point metric space (M(n), dM(n)) which is O(1)-sketchable yet for every ε ∈ (0, 12 ), if α(n) > 1 and fn : M(n) → `1ε are such that dM(n)(x, y) 6 kfn(x) − fn(y)k1ε 6 α(n)dM(n)(x, y) for all x, y ∈ M(n), then necessarily limn→∞ α(n) = ∞.

Original languageEnglish (US)
Pages1814-1824
Number of pages11
StatePublished - Jan 1 2019
Event30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019 - San Diego, United States
Duration: Jan 6 2019Jan 9 2019

Conference

Conference30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019
CountryUnited States
CitySan Diego
Period1/6/191/9/19

Fingerprint

Sketching
Normed Space
Norm
Metric
Metric space
Imply
Resolve
Availability
If and only if
Approximation
Theorem
Demonstrate

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Cite this

Khot, S., & Naor, A. (2019). The Andoni–Krauthgamer–Razenshteyn characterization of sketchable norms fails for sketchable metrics. 1814-1824. Paper presented at 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, United States.

The Andoni–Krauthgamer–Razenshteyn characterization of sketchable norms fails for sketchable metrics. / Khot, Subhash; Naor, Assaf.

2019. 1814-1824 Paper presented at 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, United States.

Research output: Contribution to conferencePaper

Khot, S & Naor, A 2019, 'The Andoni–Krauthgamer–Razenshteyn characterization of sketchable norms fails for sketchable metrics', Paper presented at 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, United States, 1/6/19 - 1/9/19 pp. 1814-1824.
Khot S, Naor A. The Andoni–Krauthgamer–Razenshteyn characterization of sketchable norms fails for sketchable metrics. 2019. Paper presented at 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, United States.
Khot, Subhash ; Naor, Assaf. / The Andoni–Krauthgamer–Razenshteyn characterization of sketchable norms fails for sketchable metrics. Paper presented at 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, United States.11 p.
@conference{06c9a710b3f04d6cb90e21c64a47045d,
title = "The Andoni–Krauthgamer–Razenshteyn characterization of sketchable norms fails for sketchable metrics",
abstract = "Andoni, Krauthgamer and Razenshteyn (AKR) proved (STOC’15) that a finite-dimensional normed space (X, k·kX) admits a O(1) sketching algorithm (namely, with O(1) sketch size and O(1) approximation) if and only if for every ε ∈ (0, 1) there exist α > 1 and an embedding f : X → `1−ε such that kx − ykX 6 kf(x) − f(y)k1−ε 6 αkx − ykX for all x, y ∈ X. 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 X is not a normed space. Due to this, a natural question that AKR posed was whether the assumption that the underlying space is a normed space is needed for their characterization of sketchability. We resolve this question by proving that for arbitrarily large n ∈ N there is an n-point metric space (M(n), dM(n)) which is O(1)-sketchable yet for every ε ∈ (0, 12 ), if α(n) > 1 and fn : M(n) → `1−ε are such that dM(n)(x, y) 6 kfn(x) − fn(y)k1−ε 6 α(n)dM(n)(x, y) for all x, y ∈ M(n), then necessarily limn→∞ α(n) = ∞.",
author = "Subhash Khot and Assaf Naor",
year = "2019",
month = "1",
day = "1",
language = "English (US)",
pages = "1814--1824",
note = "30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019 ; Conference date: 06-01-2019 Through 09-01-2019",

}

TY - CONF

T1 - The Andoni–Krauthgamer–Razenshteyn characterization of sketchable norms fails for sketchable metrics

AU - Khot, Subhash

AU - Naor, Assaf

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Andoni, Krauthgamer and Razenshteyn (AKR) proved (STOC’15) that a finite-dimensional normed space (X, k·kX) admits a O(1) sketching algorithm (namely, with O(1) sketch size and O(1) approximation) if and only if for every ε ∈ (0, 1) there exist α > 1 and an embedding f : X → `1−ε such that kx − ykX 6 kf(x) − f(y)k1−ε 6 αkx − ykX for all x, y ∈ X. 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 X is not a normed space. Due to this, a natural question that AKR posed was whether the assumption that the underlying space is a normed space is needed for their characterization of sketchability. We resolve this question by proving that for arbitrarily large n ∈ N there is an n-point metric space (M(n), dM(n)) which is O(1)-sketchable yet for every ε ∈ (0, 12 ), if α(n) > 1 and fn : M(n) → `1−ε are such that dM(n)(x, y) 6 kfn(x) − fn(y)k1−ε 6 α(n)dM(n)(x, y) for all x, y ∈ M(n), then necessarily limn→∞ α(n) = ∞.

AB - Andoni, Krauthgamer and Razenshteyn (AKR) proved (STOC’15) that a finite-dimensional normed space (X, k·kX) admits a O(1) sketching algorithm (namely, with O(1) sketch size and O(1) approximation) if and only if for every ε ∈ (0, 1) there exist α > 1 and an embedding f : X → `1−ε such that kx − ykX 6 kf(x) − f(y)k1−ε 6 αkx − ykX for all x, y ∈ X. 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 X is not a normed space. Due to this, a natural question that AKR posed was whether the assumption that the underlying space is a normed space is needed for their characterization of sketchability. We resolve this question by proving that for arbitrarily large n ∈ N there is an n-point metric space (M(n), dM(n)) which is O(1)-sketchable yet for every ε ∈ (0, 12 ), if α(n) > 1 and fn : M(n) → `1−ε are such that dM(n)(x, y) 6 kfn(x) − fn(y)k1−ε 6 α(n)dM(n)(x, y) for all x, y ∈ M(n), then necessarily limn→∞ α(n) = ∞.

UR - http://www.scopus.com/inward/record.url?scp=85066950214&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85066950214&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:85066950214

SP - 1814

EP - 1824

ER -