Given an matrix , its Schatten- norm, , is defined as $|A|p = \left (\sum{i=1}^{(A)}\sigma_i(A)^p \right )^{1/p}\sigma_i(A)iA$. These norms have been studied in functional analysis in the context of non-commutative -spaces, and recently in data stream and linear sketching models of computation. Basic questions on the relations between these norms, such as their embeddability, are still open. Specifically, given a set of matrices $A^1, \ldots, A^{\operatorname{poly}(nd)} \in ^{n \times d}LL(A^i) \in ^{n’ \times d’}in’ \leq nd’ \leq d$, and further, for a given approximation factor and real number . Then how large do and need to be as a function of ? We nearly resolve this question for every , for the case where can be expressed as , where and are arbitrary matrices that are allowed to depend on , that is, can be implemented by left and right matrix multiplication. Namely, for every , we provide nearly matching upper and lower bounds on the size of and as a function of . Importantly, our upper bounds are {\it oblivious}, meaning that and do not depend on the , while our lower bounds hold even if and depend on the . As an application of our upper bounds, we answer a recent open question of Blasiok et al. about space-approximation trade-offs for the Schatten -norm, showing in a data stream it is possible to estimate the Schatten- norm up to a factor of using space.

生成讲解博客的中文版本

生成AI智能校验的中文版本