Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms 2018
DOI: 10.1137/1.9781611975031.88
|View full text |Cite
|
Sign up to set email alerts
|

Impossibility of dimension reduction in the nuclear norm

Abstract: Abstractvet S 1 @the htten!von xeumnn tre lssA denote the fnh spe of ll ompt liner opertors T : 2 → 2 whose nuler norm T S 1 = ∞ j=1 σ j (T ) is (niteD where {σ j (T )} ∞ j=1 re the singulr vlues of T F e prove tht for ritrrily lrge n ∈ N there exists suset C ⊆ S 1 with |C| = n tht nnot e emedded with iEvipshitz distortion O(1) into ny n o(1) Edimensionl liner suspe of S 1 F C is not even O(1)Evipshitz quotient of ny suset of ny n o(1) Edimensionl liner suspe of S 1 F husD S 1 does not dmit dimension redution … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
11
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(11 citation statements)
references
References 78 publications
0
11
0
Order By: Relevance
“…The similarity of the lower bounds in (13) and (15) is not coincidental. One can view the Brinkman-Charikar example C BC ⊆ 1 also as a collection of diagonal matrices in S 1 , and [193] treats this very same subset by strengthening the assertion of [58] that C BC does not well-embed into low-dimensional subspaces of S 1 which consist entirely of diagonal matrices, to the same assertion for low-dimensional subspaces of S 1 which are now allowed to consist of any matrices whatsoever. Using our notation for relative dimension reduction moduli, this gives the stronger assertion k α n ( 1 , S 1 ) n c/α 2 .…”
Section: 22mentioning
confidence: 99%
See 4 more Smart Citations
“…The similarity of the lower bounds in (13) and (15) is not coincidental. One can view the Brinkman-Charikar example C BC ⊆ 1 also as a collection of diagonal matrices in S 1 , and [193] treats this very same subset by strengthening the assertion of [58] that C BC does not well-embed into low-dimensional subspaces of S 1 which consist entirely of diagonal matrices, to the same assertion for low-dimensional subspaces of S 1 which are now allowed to consist of any matrices whatsoever. Using our notation for relative dimension reduction moduli, this gives the stronger assertion k α n ( 1 , S 1 ) n c/α 2 .…”
Section: 22mentioning
confidence: 99%
“…By [176,91], the Brinkman-Charikar subset C BC ⊆ 1 (as well as a variant of it due to Laakso [140] which has [151] the same non-embeddability property into low-dimensional subspaces of 1 ) satisfies Π q (C BC ) (log n) 1/q for every q 2 (recall that in our notation |C BC | = n). At the same time, it is proved in [193] that Π 2 (F ) log dim(F ) for every finite dimensional subset of S 1 . It remains to contrast these asymptotic behaviors (for q = 2) to deduce that if c F (C BC ) α, then necessarily dim(F ) n c/α 2 .…”
Section: 22mentioning
confidence: 99%
See 3 more Smart Citations